View source for Hilbert-Euler problem

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

<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/h/h047/h047250/h0472501.png" /></td> </tr></table>

in prime numbers, with given prime mutually-prime coefficients.

A special case of the Hilbert–Euler problem is the problem of [[Twins|twins]]. No solution has as yet (1989) been found to the problem, except for trivial cases. See also [[Additive problems|Additive problems]].

====References====
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  "Hilbert's problems"  ''Bull. Amer. Math. Soc.'' , '''8'''  (1902)  pp. 437–479  (Translated from German)</TD></TR></table>



====Comments====


====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>