Find a sequence of 7 consecutive primes











up vote
2
down vote

favorite
1












Find a sequence of 7 consecutive primes, such that these primes have to have the same "gap" in between them. So far I have been doing this in a brute force way, by looking at a list of all the primes and trying different combinations without much luck. Is there a more sophisticated way of doing this?






number-theory prime-numbers







share|cite|improve this question




















  • 3




    Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
    – Mark Bennet
    Nov 11 '14 at 18:39






  • 1




    First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
    – Steven Stadnicki
    Nov 11 '14 at 18:40






  • 1




    You can look up examples.
    – Henning Makholm
    Nov 11 '14 at 18:42






  • 2




    And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
    – Henning Makholm
    Nov 11 '14 at 18:46






  • 1




    @DietrichBurde: Those may be primes, but they are not consecutive primes.
    – Henning Makholm
    Nov 11 '14 at 18:46















up vote
2
down vote

favorite
1












Find a sequence of 7 consecutive primes, such that these primes have to have the same "gap" in between them. So far I have been doing this in a brute force way, by looking at a list of all the primes and trying different combinations without much luck. Is there a more sophisticated way of doing this?






number-theory prime-numbers







share|cite|improve this question




















  • 3




    Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
    – Mark Bennet
    Nov 11 '14 at 18:39






  • 1




    First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
    – Steven Stadnicki
    Nov 11 '14 at 18:40






  • 1




    You can look up examples.
    – Henning Makholm
    Nov 11 '14 at 18:42






  • 2




    And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
    – Henning Makholm
    Nov 11 '14 at 18:46






  • 1




    @DietrichBurde: Those may be primes, but they are not consecutive primes.
    – Henning Makholm
    Nov 11 '14 at 18:46













up vote
2
down vote

favorite
1









up vote
2
down vote

favorite
1






1





Find a sequence of 7 consecutive primes, such that these primes have to have the same "gap" in between them. So far I have been doing this in a brute force way, by looking at a list of all the primes and trying different combinations without much luck. Is there a more sophisticated way of doing this?






number-theory prime-numbers







share|cite|improve this question















Find a sequence of 7 consecutive primes, such that these primes have to have the same "gap" in between them. So far I have been doing this in a brute force way, by looking at a list of all the primes and trying different combinations without much luck. Is there a more sophisticated way of doing this?






number-theory prime-numbers




number-theory prime-numbers






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 21 at 15:02









Klangen

1,32811130




1,32811130










asked Nov 11 '14 at 18:35









Math Major

1,06021437




1,06021437








  • 3




    Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
    – Mark Bennet
    Nov 11 '14 at 18:39






  • 1




    First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
    – Steven Stadnicki
    Nov 11 '14 at 18:40






  • 1




    You can look up examples.
    – Henning Makholm
    Nov 11 '14 at 18:42






  • 2




    And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
    – Henning Makholm
    Nov 11 '14 at 18:46






  • 1




    @DietrichBurde: Those may be primes, but they are not consecutive primes.
    – Henning Makholm
    Nov 11 '14 at 18:46














  • 3




    Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
    – Mark Bennet
    Nov 11 '14 at 18:39






  • 1




    First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
    – Steven Stadnicki
    Nov 11 '14 at 18:40






  • 1




    You can look up examples.
    – Henning Makholm
    Nov 11 '14 at 18:42






  • 2




    And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
    – Henning Makholm
    Nov 11 '14 at 18:46






  • 1




    @DietrichBurde: Those may be primes, but they are not consecutive primes.
    – Henning Makholm
    Nov 11 '14 at 18:46








3




3




Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
– Mark Bennet
Nov 11 '14 at 18:39




Note that the common difference will have to be divisible by $2times 3times 5times 7=210$ in order to avoid divisibility by $2,3,5,7$.
– Mark Bennet
Nov 11 '14 at 18:39




1




1




First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
– Steven Stadnicki
Nov 11 '14 at 18:40




First, start simple: can you see why a gap of $2$ between primes won't work? Once you see that, you can ask yourself why a gap of $6=2cdot 3$ won't work, and by continuing in this approach you should be able to find the minimum gap that you can use.
– Steven Stadnicki
Nov 11 '14 at 18:40




1




1




You can look up examples.
– Henning Makholm
Nov 11 '14 at 18:42




You can look up examples.
– Henning Makholm
Nov 11 '14 at 18:42




2




2




And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
– Henning Makholm
Nov 11 '14 at 18:46




And this usenet post claims that the smallest known (as of 10 years ago) example is $149143516628800164802930723713131 + 210n$.
– Henning Makholm
Nov 11 '14 at 18:46




1




1




@DietrichBurde: Those may be primes, but they are not consecutive primes.
– Henning Makholm
Nov 11 '14 at 18:46




@DietrichBurde: Those may be primes, but they are not consecutive primes.
– Henning Makholm
Nov 11 '14 at 18:46










1 Answer
1






active

oldest

votes

















up vote
3
down vote



accepted










http://primerecords.dk/cpap.htm lists largest and smallest known examples of consecutive primes in arithmetic progression of a given length.



The first known sequence is apparently $19252884016114523644357039386451+210n$, but is not known to be the first.






share|cite|improve this answer























  • So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
    – Math Major
    Nov 11 '14 at 18:55






  • 1




    @MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
    – Henning Makholm
    Nov 11 '14 at 19:02












  • Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
    – Math Major
    Nov 11 '14 at 19:04






  • 1




    @MathMajor: Yes.
    – Henning Makholm
    Nov 11 '14 at 19:05











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',
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


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1017244%2ffind-a-sequence-of-7-consecutive-primes%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








up vote
3
down vote



accepted










http://primerecords.dk/cpap.htm lists largest and smallest known examples of consecutive primes in arithmetic progression of a given length.



The first known sequence is apparently $19252884016114523644357039386451+210n$, but is not known to be the first.






share|cite|improve this answer























  • So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
    – Math Major
    Nov 11 '14 at 18:55






  • 1




    @MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
    – Henning Makholm
    Nov 11 '14 at 19:02












  • Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
    – Math Major
    Nov 11 '14 at 19:04






  • 1




    @MathMajor: Yes.
    – Henning Makholm
    Nov 11 '14 at 19:05















up vote
3
down vote



accepted










http://primerecords.dk/cpap.htm lists largest and smallest known examples of consecutive primes in arithmetic progression of a given length.



The first known sequence is apparently $19252884016114523644357039386451+210n$, but is not known to be the first.






share|cite|improve this answer























  • So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
    – Math Major
    Nov 11 '14 at 18:55






  • 1




    @MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
    – Henning Makholm
    Nov 11 '14 at 19:02












  • Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
    – Math Major
    Nov 11 '14 at 19:04






  • 1




    @MathMajor: Yes.
    – Henning Makholm
    Nov 11 '14 at 19:05













up vote
3
down vote



accepted







up vote
3
down vote



accepted






http://primerecords.dk/cpap.htm lists largest and smallest known examples of consecutive primes in arithmetic progression of a given length.



The first known sequence is apparently $19252884016114523644357039386451+210n$, but is not known to be the first.






share|cite|improve this answer














http://primerecords.dk/cpap.htm lists largest and smallest known examples of consecutive primes in arithmetic progression of a given length.



The first known sequence is apparently $19252884016114523644357039386451+210n$, but is not known to be the first.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Nov 11 '14 at 19:05

























answered Nov 11 '14 at 18:51









Henning Makholm

236k16300534




236k16300534












  • So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
    – Math Major
    Nov 11 '14 at 18:55






  • 1




    @MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
    – Henning Makholm
    Nov 11 '14 at 19:02












  • Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
    – Math Major
    Nov 11 '14 at 19:04






  • 1




    @MathMajor: Yes.
    – Henning Makholm
    Nov 11 '14 at 19:05


















  • So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
    – Math Major
    Nov 11 '14 at 18:55






  • 1




    @MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
    – Henning Makholm
    Nov 11 '14 at 19:02












  • Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
    – Math Major
    Nov 11 '14 at 19:04






  • 1




    @MathMajor: Yes.
    – Henning Makholm
    Nov 11 '14 at 19:05
















So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
– Math Major
Nov 11 '14 at 18:55




So for simplicity I just want to pick a small one, but I just want to make sure I am reading the chart correctly, so I look at CPAP-k with a k of 7 right? So I chose: 1205967 · 61# + x32a + 210n but I don't understand what the a and # are symbolizing?
– Math Major
Nov 11 '14 at 18:55




1




1




@MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
– Henning Makholm
Nov 11 '14 at 19:02






@MathMajor: $61#$ is a primorial, that is, the product of all primes up to $61$. And $x_{32a}$ is a particular 32-digit number that is listed further down that page. The smallest known CPAP-7 base is quoted explicitly slightly above the "smallest known CPAP-k" table, after the words "The smallest known is 32 digits".
– Henning Makholm
Nov 11 '14 at 19:02














Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
– Math Major
Nov 11 '14 at 19:04




Oh ok, so primorial is like a factorial, but exclusively for the prime numberS?
– Math Major
Nov 11 '14 at 19:04




1




1




@MathMajor: Yes.
– Henning Makholm
Nov 11 '14 at 19:05




@MathMajor: Yes.
– Henning Makholm
Nov 11 '14 at 19:05


















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














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f1017244%2ffind-a-sequence-of-7-consecutive-primes%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

Le Mesnil-Réaume

Image
Le Mesnil-Réaume Region Normandie Département Seine-Maritime Arrondissement Dieppe Kanton Eu Gemeindeverband Villes Sœurs Koordinaten 49° 58′  N , 1° 27′  O 49.9725 1.4463888888889 Koordinaten: 49° 58′  N , 1° 27′  O Höhe 92–156 m Fläche 5,55 km 2 Einwohner 793 (1. Januar 2016) Bevölkerungsdichte 143 Einw./km 2 Postleitzahl 76260 INSEE-Code 76435 Website http://www.mesnil-reaume.net/ Rathaus (Mairie) und Schule von Le Mesnil-Réaume Le Mesnil-Réaume ist eine französische Gemeinde mit 793 Einwohnern (Stand: 1. Januar 2016) im Département Seine-Maritime in der Region Normandie (vor 2016 Haute-Normandie). Sie gehört zum Arrondissement Dieppe und zum Kanton Eu. Die Einwohner werden Mesnillais genannt. Inhaltsverzeichnis 1 Geographie 2 Bevölkerungsentwicklung 3 Sehenswürdigkeiten 4 Weblinks Geographie | Le Mesnil-Réaume liegt etwa 43 Kilomet
Read more

Ida-Boy-Ed-Garten

Image
Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
Read more

web3.py web3.isConnected() returns false always

Image
1 I am trying an tutorial on web3.py so i created a profile in infura and used its project id.But it shows false always when i try web3.isConnected() PS C:UsersHP> python Python 3.6.3 (v3.6.3:2c5fed8, Oct 3 2017, 18:11:49) [MSC v.1900 64 bit (AMD64)] on win32 Type "help", "copyright", "credits" or "license" for more information. >>> from web3 import Web3 >>> infura_url = "mainnet.infura.io/v3/******************************" >>> web3 = Web3(Web3.HTTPProvider(infura_url)) >>> web3.isConnected() False web3.py share | improve this question
Read more