Search results
Results from the WOW.Com Content Network
Singmaster's conjecture is a conjecture in combinatorial number theory, named after the British mathematician David Singmaster who proposed it in 1971. It says that there is a finite upper bound on the multiplicities of entries in Pascal's triangle (other than the number 1, which appears infinitely many times).
Basel problem on ζ(2) Hurwitz zeta function; Bernoulli number. Agoh–Giuga conjecture; Von Staudt–Clausen theorem; Dirichlet series; Euler product; Prime number theorem. Prime-counting function. Meissel–Lehmer algorithm; Offset logarithmic integral; Legendre's constant; Skewes' number; Bertrand's postulate. Proof of Bertrand's postulate
Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, model theory, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations.
Number theory is a branch of pure mathematics devoted primarily to the study of the integers and arithmetic functions.German mathematician Carl Friedrich Gauss (1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics."
Landau's fourth problem asked whether there are infinitely many primes which are of the form = + for integer n. (The list of known primes of this form is A002496 .) The existence of infinitely many such primes would follow as a consequence of other number-theoretic conjectures such as the Bunyakovsky conjecture and Bateman–Horn conjecture .
Pages in category "Unsolved problems in number theory" The following 106 pages are in this category, out of 106 total. This list may not reflect recent changes .
A large part of analytic number theory deals with multiplicative problems, and so most of its texts contain sections on multiplicative number theory. These are some well-known texts that deal specifically with multiplicative problems: Davenport, Harold (2000). Multiplicative Number Theory (3rd ed.). Berlin: Springer. ISBN 978-0-387-95097-6.
To illustrate, the solution + = has bases with a common factor of 3, the solution + = has bases with a common factor of 7, and + = + has bases with a common factor of 2. Indeed the equation has infinitely many solutions where the bases share a common factor, including generalizations of the above three examples, respectively