Difference between revisions of "Hilbert-Euler problem"
Ulf Rehmann (talk | contribs) m (moved Hilbert–Euler problem to Hilbert-Euler problem: ascii title) |
(Category:Number theory) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| + | {{TEX|done}} | ||
A generalization of the Goldbach–Euler problem (cf. [[Goldbach problem|Goldbach problem]]) according to which any even natural number larger than 2 can be represented as the sum of two prime numbers. | A generalization of the Goldbach–Euler problem (cf. [[Goldbach problem|Goldbach problem]]) according to which any even natural number larger than 2 can be represented as the sum of two prime numbers. | ||
The Hilbert–Euler problem was formulated by D. Hilbert [[#References|[1]]] as part of a problem on prime numbers (Hilbert's eighth problem). In fact, Hilbert advanced the hypothesis according to which the problem of the distribution of prime numbers allows one to solve both the Goldbach–Euler problem and the more general problem of solvability of the linear Diophantine equation | The Hilbert–Euler problem was formulated by D. Hilbert [[#References|[1]]] as part of a problem on prime numbers (Hilbert's eighth problem). In fact, Hilbert advanced the hypothesis according to which the problem of the distribution of prime numbers allows one to solve both the Goldbach–Euler problem and the more general problem of solvability of the linear Diophantine equation | ||
| − | + | $$ax+by+c=0$$ | |
in prime numbers, with given prime mutually-prime coefficients. | in prime numbers, with given prime mutually-prime coefficients. | ||
| Line 19: | Line 20: | ||
====References==== | ====References==== | ||
<table><TR><TD valign="top">[a1]</TD> <TD valign="top"> F.E. Browder (ed.) , ''Mathematical developments arising from Hilbert problems'' , ''Proc. Symp. Pure Math.'' , '''28''' , Amer. Math. Soc. (1976)</TD></TR></table> | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> F.E. Browder (ed.) , ''Mathematical developments arising from Hilbert problems'' , ''Proc. Symp. Pure Math.'' , '''28''' , Amer. Math. Soc. (1976)</TD></TR></table> | ||
| + | |||
| + | [[Category:Number theory]] | ||
Latest revision as of 20:18, 14 October 2014
A generalization of the Goldbach–Euler problem (cf. Goldbach problem) according to which any even natural number larger than 2 can be represented as the sum of two prime numbers.
The Hilbert–Euler problem was formulated by D. Hilbert [1] as part of a problem on prime numbers (Hilbert's eighth problem). In fact, Hilbert advanced the hypothesis according to which the problem of the distribution of prime numbers allows one to solve both the Goldbach–Euler problem and the more general problem of solvability of the linear Diophantine equation
$$ax+by+c=0$$
in prime numbers, with given prime mutually-prime coefficients.
A special case of the Hilbert–Euler problem is the problem of twins. No solution has as yet (1989) been found to the problem, except for trivial cases. See also Additive problems.
References
| [1] | "Hilbert's problems" Bull. Amer. Math. Soc. , 8 (1902) pp. 437–479 (Translated from German) |
Comments
References
| [a1] | F.E. Browder (ed.) , Mathematical developments arising from Hilbert problems , Proc. Symp. Pure Math. , 28 , Amer. Math. Soc. (1976) |
Hilbert-Euler problem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Hilbert-Euler_problem&oldid=22567