Mixing
$n$ such $n!+1$ and $n!-1$ are both primes
4
I am looking for positive integers $n$ such that $n!+1$ and $n!-1$ are both primes.
Looking in OEIS Lists, I found that the only known $n$ such $n!+1$ and $n!-1$ are both primes is $n=3$ (giving $5$ and $7$).
Is it known if $3$ is only value for $n$ or is it still an open problem ?
number-theory elementary-number-theory prime-numbers prime-twins
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
|
show 4 more comments
4
I am looking for positive integers $n$ such that $n!+1$ and $n!-1$ are both primes.
Looking in OEIS Lists, I found that the only known $n$ such $n!+1$ and $n!-1$ are both primes is $n=3$ (giving $5$ and $7$).
Is it known if $3$ is only value for $n$ or is it still an open problem ?
number-theory elementary-number-theory prime-numbers prime-twins
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
1
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
2
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40
|
show 4 more comments
4
4
4
1
I am looking for positive integers $n$ such that $n!+1$ and $n!-1$ are both primes.
Looking in OEIS Lists, I found that the only known $n$ such $n!+1$ and $n!-1$ are both primes is $n=3$ (giving $5$ and $7$).
Is it known if $3$ is only value for $n$ or is it still an open problem ?
number-theory elementary-number-theory prime-numbers prime-twins
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
I am looking for positive integers $n$ such that $n!+1$ and $n!-1$ are both primes.
Looking in OEIS Lists, I found that the only known $n$ such $n!+1$ and $n!-1$ are both primes is $n=3$ (giving $5$ and $7$).
Is it known if $3$ is only value for $n$ or is it still an open problem ?
number-theory elementary-number-theory prime-numbers prime-twins
number-theory elementary-number-theory prime-numbers prime-twins
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
edited Nov 21 '18 at 11:50
José Carlos Santos
151k22123224
151k22123224
asked Jan 13 '17 at 16:52
BenLaz
476215
asked Jan 13 '17 at 16:52
BenLaz
476215
asked Jan 13 '17 at 16:52
BenLaz
476215
476215
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
1
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
2
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40
|
show 4 more comments
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
1
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
2
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
1
1
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
2
2
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40
|
show 4 more comments
0
active
oldest
votes
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
});
}
});
draft saved
draft discarded
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%2f2096369%2fn-such-n1-and-n-1-are-both-primes%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
draft saved
draft discarded
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
To learn more, see our tips on writing great answers.
draft saved
draft discarded
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%2f2096369%2fn-such-n1-and-n-1-are-both-primes%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
It's a well-known conjecture of Erdős for the $n!+1$ case, actually...
– Parcly Taxel
Jan 13 '17 at 16:55
Take a look at this en.wikipedia.org/wiki/Factorial_prime
– kingW3
Jan 13 '17 at 16:58
@kingW3 : I took a look to this article, but they don't speak about the case of $n!+1$ and $n!-1$ being both prime
– BenLaz
Jan 13 '17 at 17:01
1
Did you read the line labeled "COMMENTS"?
– Nate
Jan 13 '17 at 17:13
2
I don't know any source, if you want I can sketch why the "standard" heuristics (i.e. a probabilistic model) suggests that we should only expect finitely many such numbers. Proving such heuristics actually hold is in general very difficult though and I'd expect this to be about as hard as say proving there are finitely many Fermat primes.
– Nate
Jan 13 '17 at 17:40