Listing 1 - 10 of 13 | << page >> |
Sort by
|
Choose an application
511.3 --- Analytical, additive and other number-theory problems. Diophantine approximations --- 511.3 Analytical, additive and other number-theory problems. Diophantine approximations --- Diophantine analysis --- Number theory --- Number study --- Numbers, Theory of --- Algebra --- Indeterminate analysis --- Forms, Quadratic --- Number Theory
Choose an application
Choose an application
Inequalities (Mathematics) --- 512.622 --- Polynomials --- 517.518.8 --- Algebra --- Processes, Infinite --- Polynomials, including binomials and prime factors --- Approximation of functions by polynomials and their generalizations --- Polynomials. --- Inequalities (Mathematics). --- 517.518.8 Approximation of functions by polynomials and their generalizations --- 512.622 Polynomials, including binomials and prime factors --- Inequalities(Mathematics) --- Functions --- Fonctions (mathématiques) --- Fonctions de plusieurs variables réelles --- Inégalités (mathématiques) --- Polynomes
Choose an application
Number Theory --- Computational Complexity --- Elliptic functions --- Pi --- 517.58 --- 511.3 --- 510.5 --- Computational complexity --- Number theory --- 681.3*F2 --- Transcendental numbers --- Circle-squaring --- Number study --- Numbers, Theory of --- Algebra --- Elliptic integrals --- Functions, Elliptic --- Integrals, Elliptic --- Transcendental functions --- Functions of complex variables --- Integrals, Hyperelliptic --- Complexity, Computational --- Electronic data processing --- Machine theory --- Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials. --- Analytical, additive and other number-theory problems. Diophantine approximations --- Algorithms. Computable functions --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- 510.5 Algorithms. Computable functions --- 511.3 Analytical, additive and other number-theory problems. Diophantine approximations --- 517.58 Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials. --- Special functions. Hyperbolic functions. Euler integrals. Gamma functions. Elliptic functions and integrals. Bessel functions. Other cylindrical functions. Spherical functions. Legendre polynomials. Orthogonal polynomials. Chebyshev polynomials
Choose an application
511 --- 511 Number theory --- Number theory --- Pi. --- Pi --- #TELE:SISTA --- Transcendental numbers --- Circle-squaring --- Mathematics
Choose an application
Pi --- 511 --- 511 Number theory --- Number theory --- Transcendental numbers --- Circle-squaring
Choose an application
Number theory --- wiskunde --- Riemann, Hugo
Choose an application
The Riemann Hypothesis has become the Holy Grail of mathematics in the century and a half since 1859 when Bernhard Riemann, one of the extraordinary mathematical talents of the 19th century, originally posed the problem. While the problem is notoriously difficult, and complicated even to state carefully, it can be loosely formulated as "the number of integers with an even number of prime factors is the same as the number of integers with an odd number of prime factors." The Hypothesis makes a very precise connection between two seemingly unrelated mathematical objects, namely prime numbers and the zeros of analytic functions. If solved, it would give us profound insight into number theory and, in particular, the nature of prime numbers. This book is an introduction to the theory surrounding the Riemann Hypothesis. Part I serves as a compendium of known results and as a primer for the material presented in the 20 original papers contained in Part II. The original papers place the material into historical context and illustrate the motivations for research on and around the Riemann Hypothesis. Several of these papers focus on computation of the zeta function, while others give proofs of the Prime Number Theorem, since the Prime Number Theorem is so closely connected to the Riemann Hypothesis. The text is suitable for a graduate course or seminar or simply as a reference for anyone interested in this extraordinary conjecture.
Riemann hypothesis. --- Numbers, Prime. --- Number theory. --- Riemann, Bernhard, --- Number Theory. --- History of Mathematical Sciences. --- Number study --- Numbers, Theory of --- Algebra --- Mathematics. --- History. --- Annals --- Auxiliary sciences of history --- Math --- Science --- Riemann, B. --- Riman, Georg Fridrikh Bernkhard, --- Riman, Bernkhard, --- Riemann, Georg Friedrich Bernhard,
Choose an application
Number theory --- Mathematics --- geschiedenis --- wiskunde --- getallenleer
Choose an application
Numbers, Prime --- Number theory --- Riemann hypothesis --- Riemann, Bernhard,
Listing 1 - 10 of 13 | << page >> |
Sort by
|