Is there a way to predict the difference between two primes based on previous differences
0
If we know the difference between for instance
$5-3=2$ and if we also know the difference between
$7-5=2$, can we then predict the difference between
$X-7=$? Where $X = 11$.
Is there an equation/algorithm that can predict the difference without knowing $X$? Based on sums or something?
prime-numbers
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
add a comment |
0
If we know the difference between for instance
$5-3=2$ and if we also know the difference between
$7-5=2$, can we then predict the difference between
$X-7=$? Where $X = 11$.
Is there an equation/algorithm that can predict the difference without knowing $X$? Based on sums or something?
prime-numbers
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08
add a comment |
0
0
0
If we know the difference between for instance
$5-3=2$ and if we also know the difference between
$7-5=2$, can we then predict the difference between
$X-7=$? Where $X = 11$.
Is there an equation/algorithm that can predict the difference without knowing $X$? Based on sums or something?
prime-numbers
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
If we know the difference between for instance
$5-3=2$ and if we also know the difference between
$7-5=2$, can we then predict the difference between
$X-7=$? Where $X = 11$.
Is there an equation/algorithm that can predict the difference without knowing $X$? Based on sums or something?
prime-numbers
prime-numbers
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
edited Nov 21 '18 at 13:35
Klangen
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
edited Nov 21 '18 at 13:35
Klangen
1,65411334
edited Nov 21 '18 at 13:35
Klangen
1,65411334
edited Nov 21 '18 at 13:35
Klangen
1,65411334
1,65411334
asked Jul 27 '17 at 16:27
Simon
435
asked Jul 27 '17 at 16:27
Simon
435
asked Jul 27 '17 at 16:27
Simon
435
435
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08
add a comment |
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08
add a comment |
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%2f2373794%2fis-there-a-way-to-predict-the-difference-between-two-primes-based-on-previous-di%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%2f2373794%2fis-there-a-way-to-predict-the-difference-between-two-primes-based-on-previous-di%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
not really but we can prove that say 5 consecutive differences can't all be the same ( unless they are 5 ( impossible in the odd primes)), in any 5 values at least 2 must share their remainders when dividing by 5. this is a straight application of the pigeonhole principle to primes in arithmetic progressions.
– user451844
Jul 27 '17 at 16:38
If the Twin Prime Conjecture mathworld.wolfram.com/TwinPrimeConjecture.html is false, then we can say there is a number M so that $p_{i+1}-p_i$>2 , where $p_i$ is the $i_th$ prime.
– gary
Jul 27 '17 at 16:42
For any sequence $a_1,a_2,a_3,cdots$ of which $a_1$ is known, knowing the sequence of differences $a_2-a_1, a_3-a_2, a_4-a_3,cdots$ is exactly the same thing as knowing the sequence itself.
– user228113
Jul 27 '17 at 16:46
we know all primes greater than 3 are 1 or 5 remainder on division by 6 ...
– user451844
Jul 27 '17 at 17:08