Circle $x^2 + y^2 = n!$ doesn't hit any lattice points for any $n$ except for $0$, $1$, $2$ and $6$ or does it? The Next CEO of Stack OverflowCounting lattice points on an n-simplexCondition for existence of certain lattice points on polytopesApproximate functional equation for Dirichlet eta, does any exist?Convex hull of lattice points in a circleA quadratic form represents all primes except for the primes 2 and 11. For any prime $p$, is there $C$ such that if $xge C$, then all but one integer among $x+1, x+2, dots, x+p$ has Greatest Prime Factor $> p$Calculating pisano periods for any integerDoes theta(n)<n for all n imply the Riemann Hypothesis and/or vice versa?Iterations of 2^(n-1)+5: the strong law of small numbers, or something bigger?Are lattice points in thin spherical shells uniformly distributed?
Circle $x^2 + y^2 = n!$ doesn't hit any lattice points for any $n$ except for $0$, $1$, $2$ and $6$ or does it?
The Next CEO of Stack OverflowCounting lattice points on an n-simplexCondition for existence of certain lattice points on polytopesApproximate functional equation for Dirichlet eta, does any exist?Convex hull of lattice points in a circleA quadratic form represents all primes except for the primes 2 and 11. For any prime $p$, is there $C$ such that if $xge C$, then all but one integer among $x+1, x+2, dots, x+p$ has Greatest Prime Factor $> p$Calculating pisano periods for any integerDoes theta(n)<n for all n imply the Riemann Hypothesis and/or vice versa?Iterations of 2^(n-1)+5: the strong law of small numbers, or something bigger?Are lattice points in thin spherical shells uniformly distributed?
$begingroup$
I stumbled across the following problem in high school:$$
x^2 + y^2 = n!
$$
I tested it within my laptop capabilities, watched a 3b1b video Pi in prime regularities, where he explains how to find the number of integer solutions based on prime factors. There doesn't seem to be any above $30!$. Maybe I'm wrong and there are infinitely many exceptions like $2$ and $6$, maybe the proof is too difficult for me to grasp or... I hope I'm just too blind to see the obvious.
nt.number-theory analytic-number-theory prime-numbers factorization
edited 2 days ago
TheSimpliFire
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I stumbled across the following problem in high school:$$
x^2 + y^2 = n!
$$
I tested it within my laptop capabilities, watched a 3b1b video Pi in prime regularities, where he explains how to find the number of integer solutions based on prime factors. There doesn't seem to be any above $30!$. Maybe I'm wrong and there are infinitely many exceptions like $2$ and $6$, maybe the proof is too difficult for me to grasp or... I hope I'm just too blind to see the obvious.
nt.number-theory analytic-number-theory prime-numbers factorization
edited 2 days ago
TheSimpliFire
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
1
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
19
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago
add a comment |
$begingroup$
I stumbled across the following problem in high school:$$
x^2 + y^2 = n!
$$
I tested it within my laptop capabilities, watched a 3b1b video Pi in prime regularities, where he explains how to find the number of integer solutions based on prime factors. There doesn't seem to be any above $30!$. Maybe I'm wrong and there are infinitely many exceptions like $2$ and $6$, maybe the proof is too difficult for me to grasp or... I hope I'm just too blind to see the obvious.
nt.number-theory analytic-number-theory prime-numbers factorization
edited 2 days ago
TheSimpliFire
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I stumbled across the following problem in high school:$$
x^2 + y^2 = n!
$$
I tested it within my laptop capabilities, watched a 3b1b video Pi in prime regularities, where he explains how to find the number of integer solutions based on prime factors. There doesn't seem to be any above $30!$. Maybe I'm wrong and there are infinitely many exceptions like $2$ and $6$, maybe the proof is too difficult for me to grasp or... I hope I'm just too blind to see the obvious.
nt.number-theory analytic-number-theory prime-numbers factorization
nt.number-theory analytic-number-theory prime-numbers factorization
edited 2 days ago
TheSimpliFire
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 2 days ago
TheSimpliFire
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
edited 2 days ago
TheSimpliFire
12310
edited 2 days ago
TheSimpliFire
12310
edited 2 days ago
TheSimpliFire
12310
12310
asked 2 days ago
BetydligBetydlig
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 2 days ago
BetydligBetydlig
763
asked 2 days ago
BetydligBetydlig
763
763
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Betydlig is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
1
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
19
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago
add a comment |
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
1
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
19
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
1
1
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
19
19
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For $ngeq 7$, Erdős proved in 1932 that there is a prime $n/2<pleq n$ of the form $p=4k+3$. From this he deduces (in the same paper) that $1!$, $2!$, $6!$ are the only factorials which can be written as a sum of two squares.
answered 2 days ago
GH from MOGH from MO
59.1k5147225
$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: "504"
;
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
);
);
Betydlig is a new contributor. Be nice, and check out our Code of Conduct.
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%2fmathoverflow.net%2fquestions%2f326745%2fcircle-x2-y2-n-doesnt-hit-any-lattice-points-for-any-n-except-for-0%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
For $ngeq 7$, Erdős proved in 1932 that there is a prime $n/2<pleq n$ of the form $p=4k+3$. From this he deduces (in the same paper) that $1!$, $2!$, $6!$ are the only factorials which can be written as a sum of two squares.
answered 2 days ago
GH from MOGH from MO
59.1k5147225
$endgroup$
add a comment |
$begingroup$
For $ngeq 7$, Erdős proved in 1932 that there is a prime $n/2<pleq n$ of the form $p=4k+3$. From this he deduces (in the same paper) that $1!$, $2!$, $6!$ are the only factorials which can be written as a sum of two squares.
answered 2 days ago
GH from MOGH from MO
59.1k5147225
$endgroup$
add a comment |
$begingroup$
For $ngeq 7$, Erdős proved in 1932 that there is a prime $n/2<pleq n$ of the form $p=4k+3$. From this he deduces (in the same paper) that $1!$, $2!$, $6!$ are the only factorials which can be written as a sum of two squares.
answered 2 days ago
GH from MOGH from MO
59.1k5147225
$endgroup$
For $ngeq 7$, Erdős proved in 1932 that there is a prime $n/2<pleq n$ of the form $p=4k+3$. From this he deduces (in the same paper) that $1!$, $2!$, $6!$ are the only factorials which can be written as a sum of two squares.
answered 2 days ago
GH from MOGH from MO
59.1k5147225
answered 2 days ago
GH from MOGH from MO
59.1k5147225
answered 2 days ago
GH from MOGH from MO
59.1k5147225
answered 2 days ago
GH from MOGH from MO
59.1k5147225
59.1k5147225
add a comment |
add a comment |
Betydlig is a new contributor. Be nice, and check out our Code of Conduct.
Betydlig is a new contributor. Be nice, and check out our Code of Conduct.
Betydlig is a new contributor. Be nice, and check out our Code of Conduct.
Betydlig is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to MathOverflow!
- 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%2fmathoverflow.net%2fquestions%2f326745%2fcircle-x2-y2-n-doesnt-hit-any-lattice-points-for-any-n-except-for-0%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
$begingroup$
Hi and welcome to MO. What is your question?
$endgroup$
– Amir Sagiv
2 days ago
1
$begingroup$
Hi. The question is: are there any integers above 6 for which this equation has integer pairs (x,y) as solutions.
$endgroup$
– Betydlig
2 days ago
19
$begingroup$
At least for sufficiently large $n$, there will be a prime $p equiv 3 bmod 4$ such that $p le n < 2p$. Then $p$ divides $n!$ exactly once, hence $n!$ cannot be a sum of two squares.
$endgroup$
– Michael Stoll
2 days ago