${ninmathbb N|ninmathbb P wedge n ^2+2inmathbb P}$ is finite
$begingroup$
In an article on Wikipedia there is a claim of a proof that it don't exist infinitely many $ninmathbb N$ such that both $n$ and $n^2+2$ are primes. I don't understand that and would be pleased if someone could explain.
Okay, thank you, but it is the text in that section that I don't understand. This is supposed to have something to do with integer-valued polynomials and fixed prime divisors.
elementary-number-theory polynomials prime-numbers
asked Jan 5 at 23:14
LehsLehs
6,99731664
$endgroup$
add a comment |
$begingroup$
In an article on Wikipedia there is a claim of a proof that it don't exist infinitely many $ninmathbb N$ such that both $n$ and $n^2+2$ are primes. I don't understand that and would be pleased if someone could explain.
Okay, thank you, but it is the text in that section that I don't understand. This is supposed to have something to do with integer-valued polynomials and fixed prime divisors.
elementary-number-theory polynomials prime-numbers
asked Jan 5 at 23:14
LehsLehs
6,99731664
$endgroup$
2
$begingroup$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
4
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19
add a comment |
$begingroup$
In an article on Wikipedia there is a claim of a proof that it don't exist infinitely many $ninmathbb N$ such that both $n$ and $n^2+2$ are primes. I don't understand that and would be pleased if someone could explain.
Okay, thank you, but it is the text in that section that I don't understand. This is supposed to have something to do with integer-valued polynomials and fixed prime divisors.
elementary-number-theory polynomials prime-numbers
asked Jan 5 at 23:14
LehsLehs
6,99731664
$endgroup$
In an article on Wikipedia there is a claim of a proof that it don't exist infinitely many $ninmathbb N$ such that both $n$ and $n^2+2$ are primes. I don't understand that and would be pleased if someone could explain.
Okay, thank you, but it is the text in that section that I don't understand. This is supposed to have something to do with integer-valued polynomials and fixed prime divisors.
elementary-number-theory polynomials prime-numbers
elementary-number-theory polynomials prime-numbers
asked Jan 5 at 23:14
LehsLehs
6,99731664
asked Jan 5 at 23:14
LehsLehs
6,99731664
edited Jan 6 at 18:51
Lehs
asked Jan 5 at 23:14
LehsLehs
6,99731664
asked Jan 5 at 23:14
LehsLehs
6,99731664
asked Jan 5 at 23:14
LehsLehs
6,99731664
6,99731664
2
$begingroup$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
4
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19
add a comment |
2
$begingroup$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
4
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19
2
2
$begingroup$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
$begingroup$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
4
4
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19
add a comment |
6 Answers
6
active
oldest
votes
$begingroup$
If $n$ and $n^2+2$ are both prime, then since $3|n(n^2+2)$, either $3|n$ or $3|n^2+2$. If also $n$ and $n^2+2$ are prime, then either $n = 3$ or $n^2 + 2 = 3$ (so $n=1$, which is not prime). Thus, there is only one (positive) integer prime $n$ such that $n^2+2$ is prime: it is $3$.
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
$endgroup$
add a comment |
$begingroup$
Read the page better: $(n-1)n(n+1)$ is divisible by $3$ as it is a product of three consecutive integers and also $3n$ is divisible by $3$, by definition.
And so $3$ also divides their sum:
$$n(n+1)(n-1) + 3n = n(n^2-1) + 3n=n^3 -n + 3n = n^3 + 2n = n(n^2+2)$$
and so $3$ either divides $n$ or it divides $n^2+2$. So it cannot be that both are primes, except when $n=3$ itself (and we have $3$ and $11$).
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
$endgroup$
add a comment |
$begingroup$
${ninmathbb Nmid ninBbb Pland n^2+2inBbb P}={3}$.
This is because $n(n^2+2)=(n-1)n(n+1)+3n$, and the RHS is divisible by $3$. Then by Euclid's lemma, $3mid nlor3mid(n^2+2)$.
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
$endgroup$
add a comment |
$begingroup$
Consider some prime integer $n geq 4$.
Then we can write $n=3k+r$, where $k$ and $r$ are positive integers ($3$ cannot divide $n$), and $r$ is $1$ or $2$.
Then $n^2+2=(3k+r)^2+2=3(3k^2+2rk)+(r^2+2)$.
You can check that $r^2+2$ is always divisible by $3$; therefore $n^2+2 geq 18$ is divisible by $3$, thus cannot be prime.
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
$endgroup$
add a comment |
$begingroup$
All primes other than $2,3$ have the form $p=6kpm1$. Accordingly, the squares of those primes have the form $p^2=6j+1$, and $p^2+2$ will have the form $6j+3$ which is divisible by $3$ on its face (see comment by lulu to original question). This leaves $2,3$ as the only possible candidates; $2^2+2=6$ and $3^2+2=11$, making $3$ the sole prime satisfying the condition.
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
$endgroup$
add a comment |
$begingroup$
Now I finally understand what Wikipedia was trying to bring about. The subring of all integer-valued polynomials with rational coefficients is a free Abelian group where all elements $f$ can be uniquely expressed as linear combinations of the (in this ring) irreducible polynomials
$displaystyle left( begin{matrix} X \ k \ end{matrix}right)=
frac{X(X-1)(X-2)cdots(X-k+1)}{k!}$
where $c_0=f(0)$ and $displaystyle c_k=f(k)-sum_{i=0}^{k-1}c_i {kchoose i}$.
Now $|gcd(c_0,dots,c_n)|$ is the greatest number that divides all outputs $f(x)$ for $xinmathbb Z$.
In the example $x(x^2+2)$: $;c_0=0,;c_1=3,;c_2=6,;c_3=6$.
answered Jan 6 at 11:56
LehsLehs
6,99731664
$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%2f3063305%2fn-in-mathbb-nn-in-mathbb-p-wedge-n-22-in-mathbb-p-is-finite%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
6 Answers
6
active
oldest
votes
6 Answers
6
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
If $n$ and $n^2+2$ are both prime, then since $3|n(n^2+2)$, either $3|n$ or $3|n^2+2$. If also $n$ and $n^2+2$ are prime, then either $n = 3$ or $n^2 + 2 = 3$ (so $n=1$, which is not prime). Thus, there is only one (positive) integer prime $n$ such that $n^2+2$ is prime: it is $3$.
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
$endgroup$
add a comment |
$begingroup$
If $n$ and $n^2+2$ are both prime, then since $3|n(n^2+2)$, either $3|n$ or $3|n^2+2$. If also $n$ and $n^2+2$ are prime, then either $n = 3$ or $n^2 + 2 = 3$ (so $n=1$, which is not prime). Thus, there is only one (positive) integer prime $n$ such that $n^2+2$ is prime: it is $3$.
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
$endgroup$
add a comment |
$begingroup$
If $n$ and $n^2+2$ are both prime, then since $3|n(n^2+2)$, either $3|n$ or $3|n^2+2$. If also $n$ and $n^2+2$ are prime, then either $n = 3$ or $n^2 + 2 = 3$ (so $n=1$, which is not prime). Thus, there is only one (positive) integer prime $n$ such that $n^2+2$ is prime: it is $3$.
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
$endgroup$
If $n$ and $n^2+2$ are both prime, then since $3|n(n^2+2)$, either $3|n$ or $3|n^2+2$. If also $n$ and $n^2+2$ are prime, then either $n = 3$ or $n^2 + 2 = 3$ (so $n=1$, which is not prime). Thus, there is only one (positive) integer prime $n$ such that $n^2+2$ is prime: it is $3$.
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
answered Jan 5 at 23:21
user3482749user3482749
4,3291119
4,3291119
add a comment |
add a comment |
$begingroup$
Read the page better: $(n-1)n(n+1)$ is divisible by $3$ as it is a product of three consecutive integers and also $3n$ is divisible by $3$, by definition.
And so $3$ also divides their sum:
$$n(n+1)(n-1) + 3n = n(n^2-1) + 3n=n^3 -n + 3n = n^3 + 2n = n(n^2+2)$$
and so $3$ either divides $n$ or it divides $n^2+2$. So it cannot be that both are primes, except when $n=3$ itself (and we have $3$ and $11$).
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
$endgroup$
add a comment |
$begingroup$
Read the page better: $(n-1)n(n+1)$ is divisible by $3$ as it is a product of three consecutive integers and also $3n$ is divisible by $3$, by definition.
And so $3$ also divides their sum:
$$n(n+1)(n-1) + 3n = n(n^2-1) + 3n=n^3 -n + 3n = n^3 + 2n = n(n^2+2)$$
and so $3$ either divides $n$ or it divides $n^2+2$. So it cannot be that both are primes, except when $n=3$ itself (and we have $3$ and $11$).
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
$endgroup$
add a comment |
$begingroup$
Read the page better: $(n-1)n(n+1)$ is divisible by $3$ as it is a product of three consecutive integers and also $3n$ is divisible by $3$, by definition.
And so $3$ also divides their sum:
$$n(n+1)(n-1) + 3n = n(n^2-1) + 3n=n^3 -n + 3n = n^3 + 2n = n(n^2+2)$$
and so $3$ either divides $n$ or it divides $n^2+2$. So it cannot be that both are primes, except when $n=3$ itself (and we have $3$ and $11$).
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
$endgroup$
Read the page better: $(n-1)n(n+1)$ is divisible by $3$ as it is a product of three consecutive integers and also $3n$ is divisible by $3$, by definition.
And so $3$ also divides their sum:
$$n(n+1)(n-1) + 3n = n(n^2-1) + 3n=n^3 -n + 3n = n^3 + 2n = n(n^2+2)$$
and so $3$ either divides $n$ or it divides $n^2+2$. So it cannot be that both are primes, except when $n=3$ itself (and we have $3$ and $11$).
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
answered Jan 5 at 23:23
Henno BrandsmaHenno Brandsma
116k349127
116k349127
add a comment |
add a comment |
$begingroup$
${ninmathbb Nmid ninBbb Pland n^2+2inBbb P}={3}$.
This is because $n(n^2+2)=(n-1)n(n+1)+3n$, and the RHS is divisible by $3$. Then by Euclid's lemma, $3mid nlor3mid(n^2+2)$.
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
$endgroup$
add a comment |
$begingroup$
${ninmathbb Nmid ninBbb Pland n^2+2inBbb P}={3}$.
This is because $n(n^2+2)=(n-1)n(n+1)+3n$, and the RHS is divisible by $3$. Then by Euclid's lemma, $3mid nlor3mid(n^2+2)$.
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
$endgroup$
add a comment |
$begingroup$
${ninmathbb Nmid ninBbb Pland n^2+2inBbb P}={3}$.
This is because $n(n^2+2)=(n-1)n(n+1)+3n$, and the RHS is divisible by $3$. Then by Euclid's lemma, $3mid nlor3mid(n^2+2)$.
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
$endgroup$
${ninmathbb Nmid ninBbb Pland n^2+2inBbb P}={3}$.
This is because $n(n^2+2)=(n-1)n(n+1)+3n$, and the RHS is divisible by $3$. Then by Euclid's lemma, $3mid nlor3mid(n^2+2)$.
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
answered Jan 6 at 2:23
Chris CusterChris Custer
14.3k3827
14.3k3827
add a comment |
add a comment |
$begingroup$
Consider some prime integer $n geq 4$.
Then we can write $n=3k+r$, where $k$ and $r$ are positive integers ($3$ cannot divide $n$), and $r$ is $1$ or $2$.
Then $n^2+2=(3k+r)^2+2=3(3k^2+2rk)+(r^2+2)$.
You can check that $r^2+2$ is always divisible by $3$; therefore $n^2+2 geq 18$ is divisible by $3$, thus cannot be prime.
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
$endgroup$
add a comment |
$begingroup$
Consider some prime integer $n geq 4$.
Then we can write $n=3k+r$, where $k$ and $r$ are positive integers ($3$ cannot divide $n$), and $r$ is $1$ or $2$.
Then $n^2+2=(3k+r)^2+2=3(3k^2+2rk)+(r^2+2)$.
You can check that $r^2+2$ is always divisible by $3$; therefore $n^2+2 geq 18$ is divisible by $3$, thus cannot be prime.
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
$endgroup$
add a comment |
$begingroup$
Consider some prime integer $n geq 4$.
Then we can write $n=3k+r$, where $k$ and $r$ are positive integers ($3$ cannot divide $n$), and $r$ is $1$ or $2$.
Then $n^2+2=(3k+r)^2+2=3(3k^2+2rk)+(r^2+2)$.
You can check that $r^2+2$ is always divisible by $3$; therefore $n^2+2 geq 18$ is divisible by $3$, thus cannot be prime.
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
$endgroup$
Consider some prime integer $n geq 4$.
Then we can write $n=3k+r$, where $k$ and $r$ are positive integers ($3$ cannot divide $n$), and $r$ is $1$ or $2$.
Then $n^2+2=(3k+r)^2+2=3(3k^2+2rk)+(r^2+2)$.
You can check that $r^2+2$ is always divisible by $3$; therefore $n^2+2 geq 18$ is divisible by $3$, thus cannot be prime.
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
edited Jan 6 at 2:28
J. W. Tanner
4,6441320
4,6441320
answered Jan 5 at 23:20
MindlackMindlack
4,900211
answered Jan 5 at 23:20
MindlackMindlack
4,900211
answered Jan 5 at 23:20
MindlackMindlack
4,900211
4,900211
add a comment |
add a comment |
$begingroup$
All primes other than $2,3$ have the form $p=6kpm1$. Accordingly, the squares of those primes have the form $p^2=6j+1$, and $p^2+2$ will have the form $6j+3$ which is divisible by $3$ on its face (see comment by lulu to original question). This leaves $2,3$ as the only possible candidates; $2^2+2=6$ and $3^2+2=11$, making $3$ the sole prime satisfying the condition.
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
$endgroup$
add a comment |
$begingroup$
All primes other than $2,3$ have the form $p=6kpm1$. Accordingly, the squares of those primes have the form $p^2=6j+1$, and $p^2+2$ will have the form $6j+3$ which is divisible by $3$ on its face (see comment by lulu to original question). This leaves $2,3$ as the only possible candidates; $2^2+2=6$ and $3^2+2=11$, making $3$ the sole prime satisfying the condition.
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
$endgroup$
add a comment |
$begingroup$
All primes other than $2,3$ have the form $p=6kpm1$. Accordingly, the squares of those primes have the form $p^2=6j+1$, and $p^2+2$ will have the form $6j+3$ which is divisible by $3$ on its face (see comment by lulu to original question). This leaves $2,3$ as the only possible candidates; $2^2+2=6$ and $3^2+2=11$, making $3$ the sole prime satisfying the condition.
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
$endgroup$
All primes other than $2,3$ have the form $p=6kpm1$. Accordingly, the squares of those primes have the form $p^2=6j+1$, and $p^2+2$ will have the form $6j+3$ which is divisible by $3$ on its face (see comment by lulu to original question). This leaves $2,3$ as the only possible candidates; $2^2+2=6$ and $3^2+2=11$, making $3$ the sole prime satisfying the condition.
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
answered Jan 6 at 3:26
Keith BackmanKeith Backman
1,5461812
1,5461812
add a comment |
add a comment |
$begingroup$
Now I finally understand what Wikipedia was trying to bring about. The subring of all integer-valued polynomials with rational coefficients is a free Abelian group where all elements $f$ can be uniquely expressed as linear combinations of the (in this ring) irreducible polynomials
$displaystyle left( begin{matrix} X \ k \ end{matrix}right)=
frac{X(X-1)(X-2)cdots(X-k+1)}{k!}$
where $c_0=f(0)$ and $displaystyle c_k=f(k)-sum_{i=0}^{k-1}c_i {kchoose i}$.
Now $|gcd(c_0,dots,c_n)|$ is the greatest number that divides all outputs $f(x)$ for $xinmathbb Z$.
In the example $x(x^2+2)$: $;c_0=0,;c_1=3,;c_2=6,;c_3=6$.
answered Jan 6 at 11:56
LehsLehs
6,99731664
$endgroup$
add a comment |
$begingroup$
Now I finally understand what Wikipedia was trying to bring about. The subring of all integer-valued polynomials with rational coefficients is a free Abelian group where all elements $f$ can be uniquely expressed as linear combinations of the (in this ring) irreducible polynomials
$displaystyle left( begin{matrix} X \ k \ end{matrix}right)=
frac{X(X-1)(X-2)cdots(X-k+1)}{k!}$
where $c_0=f(0)$ and $displaystyle c_k=f(k)-sum_{i=0}^{k-1}c_i {kchoose i}$.
Now $|gcd(c_0,dots,c_n)|$ is the greatest number that divides all outputs $f(x)$ for $xinmathbb Z$.
In the example $x(x^2+2)$: $;c_0=0,;c_1=3,;c_2=6,;c_3=6$.
answered Jan 6 at 11:56
LehsLehs
6,99731664
$endgroup$
add a comment |
$begingroup$
Now I finally understand what Wikipedia was trying to bring about. The subring of all integer-valued polynomials with rational coefficients is a free Abelian group where all elements $f$ can be uniquely expressed as linear combinations of the (in this ring) irreducible polynomials
$displaystyle left( begin{matrix} X \ k \ end{matrix}right)=
frac{X(X-1)(X-2)cdots(X-k+1)}{k!}$
where $c_0=f(0)$ and $displaystyle c_k=f(k)-sum_{i=0}^{k-1}c_i {kchoose i}$.
Now $|gcd(c_0,dots,c_n)|$ is the greatest number that divides all outputs $f(x)$ for $xinmathbb Z$.
In the example $x(x^2+2)$: $;c_0=0,;c_1=3,;c_2=6,;c_3=6$.
answered Jan 6 at 11:56
LehsLehs
6,99731664
$endgroup$
Now I finally understand what Wikipedia was trying to bring about. The subring of all integer-valued polynomials with rational coefficients is a free Abelian group where all elements $f$ can be uniquely expressed as linear combinations of the (in this ring) irreducible polynomials
$displaystyle left( begin{matrix} X \ k \ end{matrix}right)=
frac{X(X-1)(X-2)cdots(X-k+1)}{k!}$
where $c_0=f(0)$ and $displaystyle c_k=f(k)-sum_{i=0}^{k-1}c_i {kchoose i}$.
Now $|gcd(c_0,dots,c_n)|$ is the greatest number that divides all outputs $f(x)$ for $xinmathbb Z$.
In the example $x(x^2+2)$: $;c_0=0,;c_1=3,;c_2=6,;c_3=6$.
answered Jan 6 at 11:56
LehsLehs
6,99731664
edited Jan 6 at 13:49
answered Jan 6 at 11:56
LehsLehs
6,99731664
answered Jan 6 at 11:56
LehsLehs
6,99731664
answered Jan 6 at 11:56
LehsLehs
6,99731664
6,99731664
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%2f3063305%2fn-in-mathbb-nn-in-mathbb-p-wedge-n-22-in-mathbb-p-is-finite%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$
It's explained on that very page: $3mid n(n^2+2)$.
$endgroup$
– Lord Shark the Unknown
Jan 5 at 23:18
4
$begingroup$
It's a triviality. If $p>3$ is a prime then $3,|,p^2+2$.
$endgroup$
– lulu
Jan 5 at 23:19