The general proposition of Fermat
$begingroup$
In his letter to Frenicle, dated 18th October, 1640, Fermat states the following (Point 8, translated) :
If you subtract $2$ from a square, the remaining value cannot be divided by a prime which is greater than a square by $2$
For example, take for a square $1,000,000$, from which, subtracted by two, remains $999,998$. I say that the given remainder cannot be divided by $11$ or by $83$, by $227$, and so on.
You can prove the same rule for odd squares and, if I wanted, I would give you the lovely and general rule; but I'm content with having only indicated it to you.
In other words, numbers of the form $x^2 -2$ are not divisible by primes of the form $a^2 + 2$, where $x$ and $a$ are integers.
Questions :
$1)$ What is the general rule Fermat is talking about?
$2)$ Are there any modern references to this problem?
$3)$ How would Fermat have proved it?
elementary-number-theory reference-request prime-numbers math-history
$endgroup$
add a comment |
$begingroup$
In his letter to Frenicle, dated 18th October, 1640, Fermat states the following (Point 8, translated) :
If you subtract $2$ from a square, the remaining value cannot be divided by a prime which is greater than a square by $2$
For example, take for a square $1,000,000$, from which, subtracted by two, remains $999,998$. I say that the given remainder cannot be divided by $11$ or by $83$, by $227$, and so on.
You can prove the same rule for odd squares and, if I wanted, I would give you the lovely and general rule; but I'm content with having only indicated it to you.
In other words, numbers of the form $x^2 -2$ are not divisible by primes of the form $a^2 + 2$, where $x$ and $a$ are integers.
Questions :
$1)$ What is the general rule Fermat is talking about?
$2)$ Are there any modern references to this problem?
$3)$ How would Fermat have proved it?
elementary-number-theory reference-request prime-numbers math-history
$endgroup$
1
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
1
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
1
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20
add a comment |
$begingroup$
In his letter to Frenicle, dated 18th October, 1640, Fermat states the following (Point 8, translated) :
If you subtract $2$ from a square, the remaining value cannot be divided by a prime which is greater than a square by $2$
For example, take for a square $1,000,000$, from which, subtracted by two, remains $999,998$. I say that the given remainder cannot be divided by $11$ or by $83$, by $227$, and so on.
You can prove the same rule for odd squares and, if I wanted, I would give you the lovely and general rule; but I'm content with having only indicated it to you.
In other words, numbers of the form $x^2 -2$ are not divisible by primes of the form $a^2 + 2$, where $x$ and $a$ are integers.
Questions :
$1)$ What is the general rule Fermat is talking about?
$2)$ Are there any modern references to this problem?
$3)$ How would Fermat have proved it?
elementary-number-theory reference-request prime-numbers math-history
$endgroup$
In his letter to Frenicle, dated 18th October, 1640, Fermat states the following (Point 8, translated) :
If you subtract $2$ from a square, the remaining value cannot be divided by a prime which is greater than a square by $2$
For example, take for a square $1,000,000$, from which, subtracted by two, remains $999,998$. I say that the given remainder cannot be divided by $11$ or by $83$, by $227$, and so on.
You can prove the same rule for odd squares and, if I wanted, I would give you the lovely and general rule; but I'm content with having only indicated it to you.
In other words, numbers of the form $x^2 -2$ are not divisible by primes of the form $a^2 + 2$, where $x$ and $a$ are integers.
Questions :
$1)$ What is the general rule Fermat is talking about?
$2)$ Are there any modern references to this problem?
$3)$ How would Fermat have proved it?
elementary-number-theory reference-request prime-numbers math-history
elementary-number-theory reference-request prime-numbers math-history
edited Dec 9 '18 at 13:19
Henry
asked Dec 7 '18 at 4:07
HenryHenry
2,22211249
2,22211249
1
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
1
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
1
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20
add a comment |
1
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
1
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
1
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20
1
1
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
1
1
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
1
1
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
Ad 3): If $p = a^2 + 2$ divides $x^2 - 2$, then $p$ divides $x^2 - 2 + p = x^2 + a^2$. But primes $p = 4n+3$ cannot divide sums of two squares without dividing the squares themselves. This observation is due to Weil.
$endgroup$
add a comment |
$begingroup$
Let $p=a^2+2$ be a prime. Suppose $a>0$ as for $a=0$, the statement clearly does not hold. Therefore, $pequiv 3 pmod 8$. Thus, the congruence $x^2equiv 2pmod p$ has no solutions$($$2$ is a quadratic residue modulo $p$ if and only if $pequiv ±1pmod 8$$)$.
$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%2f3029449%2fthe-general-proposition-of-fermat%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Ad 3): If $p = a^2 + 2$ divides $x^2 - 2$, then $p$ divides $x^2 - 2 + p = x^2 + a^2$. But primes $p = 4n+3$ cannot divide sums of two squares without dividing the squares themselves. This observation is due to Weil.
$endgroup$
add a comment |
$begingroup$
Ad 3): If $p = a^2 + 2$ divides $x^2 - 2$, then $p$ divides $x^2 - 2 + p = x^2 + a^2$. But primes $p = 4n+3$ cannot divide sums of two squares without dividing the squares themselves. This observation is due to Weil.
$endgroup$
add a comment |
$begingroup$
Ad 3): If $p = a^2 + 2$ divides $x^2 - 2$, then $p$ divides $x^2 - 2 + p = x^2 + a^2$. But primes $p = 4n+3$ cannot divide sums of two squares without dividing the squares themselves. This observation is due to Weil.
$endgroup$
Ad 3): If $p = a^2 + 2$ divides $x^2 - 2$, then $p$ divides $x^2 - 2 + p = x^2 + a^2$. But primes $p = 4n+3$ cannot divide sums of two squares without dividing the squares themselves. This observation is due to Weil.
edited Dec 9 '18 at 10:22
Henry
2,22211249
2,22211249
answered Dec 8 '18 at 15:19
franz lemmermeyerfranz lemmermeyer
7,07522047
7,07522047
add a comment |
add a comment |
$begingroup$
Let $p=a^2+2$ be a prime. Suppose $a>0$ as for $a=0$, the statement clearly does not hold. Therefore, $pequiv 3 pmod 8$. Thus, the congruence $x^2equiv 2pmod p$ has no solutions$($$2$ is a quadratic residue modulo $p$ if and only if $pequiv ±1pmod 8$$)$.
$endgroup$
add a comment |
$begingroup$
Let $p=a^2+2$ be a prime. Suppose $a>0$ as for $a=0$, the statement clearly does not hold. Therefore, $pequiv 3 pmod 8$. Thus, the congruence $x^2equiv 2pmod p$ has no solutions$($$2$ is a quadratic residue modulo $p$ if and only if $pequiv ±1pmod 8$$)$.
$endgroup$
add a comment |
$begingroup$
Let $p=a^2+2$ be a prime. Suppose $a>0$ as for $a=0$, the statement clearly does not hold. Therefore, $pequiv 3 pmod 8$. Thus, the congruence $x^2equiv 2pmod p$ has no solutions$($$2$ is a quadratic residue modulo $p$ if and only if $pequiv ±1pmod 8$$)$.
$endgroup$
Let $p=a^2+2$ be a prime. Suppose $a>0$ as for $a=0$, the statement clearly does not hold. Therefore, $pequiv 3 pmod 8$. Thus, the congruence $x^2equiv 2pmod p$ has no solutions$($$2$ is a quadratic residue modulo $p$ if and only if $pequiv ±1pmod 8$$)$.
answered Dec 7 '18 at 7:13
Anubhab GhosalAnubhab Ghosal
1,01518
1,01518
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%2f3029449%2fthe-general-proposition-of-fermat%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
1
$begingroup$
I believe he considered 3 cases : 1) $a^2+2$ is prime, 2) $a^2+2$ is odd, 3) $a^2+2$ is any integer (general case)
$endgroup$
– rsadhvika
Dec 7 '18 at 4:19
1
$begingroup$
$x^2-2 = m*(a^2+2)$ has no solutions over positive integers, general case/rule
$endgroup$
– rsadhvika
Dec 7 '18 at 4:21
$begingroup$
Well, $a^2+2$ primes are always $2$ or $4k+3$ primes (the converse is of course not true). Not sure how that helps though
$endgroup$
– YiFan
Dec 7 '18 at 6:04
1
$begingroup$
Could the general rule be that numbers of the form $x^2-n$ are not divisible by primes of the form $a^2+n$?
$endgroup$
– tyobrien
Dec 7 '18 at 6:20