I want to collect a list of Goldbach's other conjectures
$begingroup$
I want to collect a list of Goldbach's other conjectures. I konw only two conjectures: The first one is the famous statement on writting an even number as the sum of two primes and the other one is about expressing an even number by $3$ primes.
number-theory math-history big-list
$endgroup$
add a comment |
$begingroup$
I want to collect a list of Goldbach's other conjectures. I konw only two conjectures: The first one is the famous statement on writting an even number as the sum of two primes and the other one is about expressing an even number by $3$ primes.
number-theory math-history big-list
$endgroup$
2
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23
add a comment |
$begingroup$
I want to collect a list of Goldbach's other conjectures. I konw only two conjectures: The first one is the famous statement on writting an even number as the sum of two primes and the other one is about expressing an even number by $3$ primes.
number-theory math-history big-list
$endgroup$
I want to collect a list of Goldbach's other conjectures. I konw only two conjectures: The first one is the famous statement on writting an even number as the sum of two primes and the other one is about expressing an even number by $3$ primes.
number-theory math-history big-list
number-theory math-history big-list
edited Jun 22 '18 at 10:03
José Carlos Santos
156k22125227
156k22125227
asked Jun 22 '18 at 9:45
DERDER
1,648918
1,648918
2
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23
add a comment |
2
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23
2
2
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23
add a comment |
3 Answers
3
active
oldest
votes
$begingroup$
I don't know which conjecture is that about expressing an even number by $3$ primes, but Goldbach also conjectured, in a letter to Euler written in 1752, that every odd number can be written as $2n^2+p$, with $p$ prime. Euler checked it for every number up to $2,500$. It turns out that the conjecture is false: in 1856, Moritz A. Stern, a professor of mathematics at Göttingen, found two numbers which could not be written as twice a square plus a prime, namely $5,777$ and $5,993$. These seem to be the only known counter-examples to this conjecture.
$endgroup$
add a comment |
$begingroup$
Actually, there is another "Goldbach conjecture" which Goldbach was able to prove himself:
in $1752$, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22).
$endgroup$
add a comment |
$begingroup$
I am turning @GerryMyerson's comment into an answer because it is useful and relevant to the question.
You can find all of Goldbach's correspondence with Euler at http://eulerarchive.maa.org//correspondence/correspondents/Goldbach.html (but it's all in Latin).
From the Publication Information on the website:
167 letters from the Euler-Goldbach Correspondence were published by P.H. Fuss in his Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle . The letters below all came from Fuss' book. Unfortunately, Fuss often excised the personal part of the correspondence, and published only the scientific material. A complete set of the correspondence will have to wait until the publication of the appropriate volume of the Opera Omnia
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2828281%2fi-want-to-collect-a-list-of-goldbachs-other-conjectures%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I don't know which conjecture is that about expressing an even number by $3$ primes, but Goldbach also conjectured, in a letter to Euler written in 1752, that every odd number can be written as $2n^2+p$, with $p$ prime. Euler checked it for every number up to $2,500$. It turns out that the conjecture is false: in 1856, Moritz A. Stern, a professor of mathematics at Göttingen, found two numbers which could not be written as twice a square plus a prime, namely $5,777$ and $5,993$. These seem to be the only known counter-examples to this conjecture.
$endgroup$
add a comment |
$begingroup$
I don't know which conjecture is that about expressing an even number by $3$ primes, but Goldbach also conjectured, in a letter to Euler written in 1752, that every odd number can be written as $2n^2+p$, with $p$ prime. Euler checked it for every number up to $2,500$. It turns out that the conjecture is false: in 1856, Moritz A. Stern, a professor of mathematics at Göttingen, found two numbers which could not be written as twice a square plus a prime, namely $5,777$ and $5,993$. These seem to be the only known counter-examples to this conjecture.
$endgroup$
add a comment |
$begingroup$
I don't know which conjecture is that about expressing an even number by $3$ primes, but Goldbach also conjectured, in a letter to Euler written in 1752, that every odd number can be written as $2n^2+p$, with $p$ prime. Euler checked it for every number up to $2,500$. It turns out that the conjecture is false: in 1856, Moritz A. Stern, a professor of mathematics at Göttingen, found two numbers which could not be written as twice a square plus a prime, namely $5,777$ and $5,993$. These seem to be the only known counter-examples to this conjecture.
$endgroup$
I don't know which conjecture is that about expressing an even number by $3$ primes, but Goldbach also conjectured, in a letter to Euler written in 1752, that every odd number can be written as $2n^2+p$, with $p$ prime. Euler checked it for every number up to $2,500$. It turns out that the conjecture is false: in 1856, Moritz A. Stern, a professor of mathematics at Göttingen, found two numbers which could not be written as twice a square plus a prime, namely $5,777$ and $5,993$. These seem to be the only known counter-examples to this conjecture.
answered Jun 22 '18 at 9:51
José Carlos SantosJosé Carlos Santos
156k22125227
156k22125227
add a comment |
add a comment |
$begingroup$
Actually, there is another "Goldbach conjecture" which Goldbach was able to prove himself:
in $1752$, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22).
$endgroup$
add a comment |
$begingroup$
Actually, there is another "Goldbach conjecture" which Goldbach was able to prove himself:
in $1752$, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22).
$endgroup$
add a comment |
$begingroup$
Actually, there is another "Goldbach conjecture" which Goldbach was able to prove himself:
in $1752$, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22).
$endgroup$
Actually, there is another "Goldbach conjecture" which Goldbach was able to prove himself:
in $1752$, Goldbach showed that no polynomial with integer coefficients can give a prime for all integer values (Nagell 1951, p. 65; Hardy and Wright 1979, pp. 18 and 22).
answered Jun 22 '18 at 18:42
Dietrich BurdeDietrich Burde
78.4k64386
78.4k64386
add a comment |
add a comment |
$begingroup$
I am turning @GerryMyerson's comment into an answer because it is useful and relevant to the question.
You can find all of Goldbach's correspondence with Euler at http://eulerarchive.maa.org//correspondence/correspondents/Goldbach.html (but it's all in Latin).
From the Publication Information on the website:
167 letters from the Euler-Goldbach Correspondence were published by P.H. Fuss in his Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle . The letters below all came from Fuss' book. Unfortunately, Fuss often excised the personal part of the correspondence, and published only the scientific material. A complete set of the correspondence will have to wait until the publication of the appropriate volume of the Opera Omnia
$endgroup$
add a comment |
$begingroup$
I am turning @GerryMyerson's comment into an answer because it is useful and relevant to the question.
You can find all of Goldbach's correspondence with Euler at http://eulerarchive.maa.org//correspondence/correspondents/Goldbach.html (but it's all in Latin).
From the Publication Information on the website:
167 letters from the Euler-Goldbach Correspondence were published by P.H. Fuss in his Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle . The letters below all came from Fuss' book. Unfortunately, Fuss often excised the personal part of the correspondence, and published only the scientific material. A complete set of the correspondence will have to wait until the publication of the appropriate volume of the Opera Omnia
$endgroup$
add a comment |
$begingroup$
I am turning @GerryMyerson's comment into an answer because it is useful and relevant to the question.
You can find all of Goldbach's correspondence with Euler at http://eulerarchive.maa.org//correspondence/correspondents/Goldbach.html (but it's all in Latin).
From the Publication Information on the website:
167 letters from the Euler-Goldbach Correspondence were published by P.H. Fuss in his Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle . The letters below all came from Fuss' book. Unfortunately, Fuss often excised the personal part of the correspondence, and published only the scientific material. A complete set of the correspondence will have to wait until the publication of the appropriate volume of the Opera Omnia
$endgroup$
I am turning @GerryMyerson's comment into an answer because it is useful and relevant to the question.
You can find all of Goldbach's correspondence with Euler at http://eulerarchive.maa.org//correspondence/correspondents/Goldbach.html (but it's all in Latin).
From the Publication Information on the website:
167 letters from the Euler-Goldbach Correspondence were published by P.H. Fuss in his Correspondance mathématique et physique de quelques célèbres géomètres du XVIIIème siècle . The letters below all came from Fuss' book. Unfortunately, Fuss often excised the personal part of the correspondence, and published only the scientific material. A complete set of the correspondence will have to wait until the publication of the appropriate volume of the Opera Omnia
answered Dec 5 '18 at 9:46
community wiki
Brahadeesh
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2828281%2fi-want-to-collect-a-list-of-goldbachs-other-conjectures%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
You can find all of Goldbach's correspondence with Euler at eulerarchive.maa.org//correspondence/correspondents/… (but it's all in Latin).
$endgroup$
– Gerry Myerson
Jun 22 '18 at 10:13
$begingroup$
Most of it is in German, actually. The English version (along with the originals plus detailed comments) is available at edoc.unibas.ch/58842
$endgroup$
– franz lemmermeyer
Dec 5 '18 at 18:23