Smallest PRIME containing the first 11 primes as sub-stringsSmallest number containing the first 11 primes as sub-stringsThe tilted labyrinth - Can you find the fastest path in this 3D-puzzle? (Simulator now included.)The magic of the primesWhat is the smallest rectangle containing the squares of 1 through 100?Professor Halfbrain and the prime numbersA Number Game for your SoulTo Plunder Treasure IslandsFind 93 using first 4 prime numbersMake $1,dots,15$ using $3, 9, 9, 9$Smallest number containing the first 11 primes as sub-strings
What can Thomas Cook customers who have not yet departed do now it has stopped operating?
Maximize assigned tasks to each worker
What is this end portal thingy?
Why do some modern glider wings like the Schleicher 29 have a tadpole shape rather than a teardrop shape?
Which altitudes are safest for VFR?
Is population size a parameter, or sample size a statistic?
Why isn't there armor to protect from spells in the Potterverse?
Question about a degree 5 polynomial with no rational roots
GPLv3 forces us to make code available, but to who?
Top off gas with old oil, is that bad?
Pushing the e-pawn
Is there a relationship between prime numbers and music?
split 1 column input into 5 column bed file
Can I build a half bath without permits?
Convert a string of digits from words to an integer
Selection Sort Algorithm (Python)
Can I target any number of creatures, even if the ability would have no effect?
Speed and Velocity in Russian
What's the hidden joke/meaning behind "Don't drink and park - accidents cause people"?
My machine, client installed VPN,
How much horsepower to weight is required for a 1:1 thrust ratio
Sci-fi movie with one survivor and an organism(?) recreating his memories
Why is Pelosi so opposed to impeaching Trump?
A famous scholar sent me an unpublished draft of hers. Then she died. I think her work should be published. What should I do?
Smallest PRIME containing the first 11 primes as sub-strings
Smallest number containing the first 11 primes as sub-stringsThe tilted labyrinth - Can you find the fastest path in this 3D-puzzle? (Simulator now included.)The magic of the primesWhat is the smallest rectangle containing the squares of 1 through 100?Professor Halfbrain and the prime numbersA Number Game for your SoulTo Plunder Treasure IslandsFind 93 using first 4 prime numbersMake $1,dots,15$ using $3, 9, 9, 9$Smallest number containing the first 11 primes as sub-strings
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
In Smallest number containing the first 11 primes as sub-strings, @Alconja successfully found the smallest number which contains the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31) as concatenated sub-strings. This inspired me to propose the following followup:
What is the smallest prime which contains each of the first eleven primes as a sub-string?
Obviously the answer is at least
113,171,923,295,
but that's not prime. How much further do we need to go?
Disclaimer: I don't know the answer myself. I'm hoping it won't need a computer to find ...
mathematics optimization number-theory
$endgroup$
|
show 2 more comments
$begingroup$
In Smallest number containing the first 11 primes as sub-strings, @Alconja successfully found the smallest number which contains the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31) as concatenated sub-strings. This inspired me to propose the following followup:
What is the smallest prime which contains each of the first eleven primes as a sub-string?
Obviously the answer is at least
113,171,923,295,
but that's not prime. How much further do we need to go?
Disclaimer: I don't know the answer myself. I'm hoping it won't need a computer to find ...
mathematics optimization number-theory
$endgroup$
2
$begingroup$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
1
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
2
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago
|
show 2 more comments
$begingroup$
In Smallest number containing the first 11 primes as sub-strings, @Alconja successfully found the smallest number which contains the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31) as concatenated sub-strings. This inspired me to propose the following followup:
What is the smallest prime which contains each of the first eleven primes as a sub-string?
Obviously the answer is at least
113,171,923,295,
but that's not prime. How much further do we need to go?
Disclaimer: I don't know the answer myself. I'm hoping it won't need a computer to find ...
mathematics optimization number-theory
$endgroup$
In Smallest number containing the first 11 primes as sub-strings, @Alconja successfully found the smallest number which contains the first eleven primes (2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31) as concatenated sub-strings. This inspired me to propose the following followup:
What is the smallest prime which contains each of the first eleven primes as a sub-string?
Obviously the answer is at least
113,171,923,295,
but that's not prime. How much further do we need to go?
Disclaimer: I don't know the answer myself. I'm hoping it won't need a computer to find ...
mathematics optimization number-theory
mathematics optimization number-theory
asked 8 hours ago
Rand al'ThorRand al'Thor
76.2k15 gold badges250 silver badges501 bronze badges
76.2k15 gold badges250 silver badges501 bronze badges
2
$begingroup$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
1
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
2
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago
|
show 2 more comments
2
$begingroup$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
1
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
2
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago
2
2
$begingroup$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
$begingroup$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
1
1
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
2
2
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago
|
show 2 more comments
3 Answers
3
active
oldest
votes
$begingroup$
So I can't yet prove this is the smallest, but it's at least an upper bound:
113,175,192,329
Reasoning:
Obviously, we have to get that 5 away from the last digit or else it's a multiple of 5. But we can't break up the 29, 23, or 19 or we lose those primes. So I tried moving the 5 back a few digits. 113,171,923,529 is divisible by 7. 113,171,952,329 is divisible by 337. But 113,175,192,329 is prime. Might be able to improve on that with some other permutations...
$endgroup$
add a comment
|
$begingroup$
Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:
113,172,923,519
$endgroup$
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
add a comment
|
$begingroup$
The answer is
113,171,952,923
I wrote a Java program to find it:
The program uses brute force by starting with the lower bound obtained in the previous question (113,171,923,295) and finding the next prime that contains the required primes as substrings. It turns out that we only need to check 29628 possibilities, which is not many. Here is the program: https://pastebin.com/XQL6VGnc
$endgroup$
add a comment
|
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "559"
;
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: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
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/4.0/"u003ecc by-sa 4.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%2fpuzzling.stackexchange.com%2fquestions%2f89448%2fsmallest-prime-containing-the-first-11-primes-as-sub-strings%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
So I can't yet prove this is the smallest, but it's at least an upper bound:
113,175,192,329
Reasoning:
Obviously, we have to get that 5 away from the last digit or else it's a multiple of 5. But we can't break up the 29, 23, or 19 or we lose those primes. So I tried moving the 5 back a few digits. 113,171,923,529 is divisible by 7. 113,171,952,329 is divisible by 337. But 113,175,192,329 is prime. Might be able to improve on that with some other permutations...
$endgroup$
add a comment
|
$begingroup$
So I can't yet prove this is the smallest, but it's at least an upper bound:
113,175,192,329
Reasoning:
Obviously, we have to get that 5 away from the last digit or else it's a multiple of 5. But we can't break up the 29, 23, or 19 or we lose those primes. So I tried moving the 5 back a few digits. 113,171,923,529 is divisible by 7. 113,171,952,329 is divisible by 337. But 113,175,192,329 is prime. Might be able to improve on that with some other permutations...
$endgroup$
add a comment
|
$begingroup$
So I can't yet prove this is the smallest, but it's at least an upper bound:
113,175,192,329
Reasoning:
Obviously, we have to get that 5 away from the last digit or else it's a multiple of 5. But we can't break up the 29, 23, or 19 or we lose those primes. So I tried moving the 5 back a few digits. 113,171,923,529 is divisible by 7. 113,171,952,329 is divisible by 337. But 113,175,192,329 is prime. Might be able to improve on that with some other permutations...
$endgroup$
So I can't yet prove this is the smallest, but it's at least an upper bound:
113,175,192,329
Reasoning:
Obviously, we have to get that 5 away from the last digit or else it's a multiple of 5. But we can't break up the 29, 23, or 19 or we lose those primes. So I tried moving the 5 back a few digits. 113,171,923,529 is divisible by 7. 113,171,952,329 is divisible by 337. But 113,175,192,329 is prime. Might be able to improve on that with some other permutations...
answered 8 hours ago
Darrel HoffmanDarrel Hoffman
2,69911 silver badges26 bronze badges
2,69911 silver badges26 bronze badges
add a comment
|
add a comment
|
$begingroup$
Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:
113,172,923,519
$endgroup$
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
add a comment
|
$begingroup$
Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:
113,172,923,519
$endgroup$
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
add a comment
|
$begingroup$
Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:
113,172,923,519
$endgroup$
Shuffling the sequence of 5 and the non- overlapping 19, 23, and 29 by trial and error produces:
113,172,923,519
answered 7 hours ago
collapsarcollapsar
3931 silver badge6 bronze badges
3931 silver badge6 bronze badges
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
add a comment
|
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
$begingroup$
I figured it could go smaller, just didn't have time to play around with it anymore...
$endgroup$
– Darrel Hoffman
7 hours ago
add a comment
|
$begingroup$
The answer is
113,171,952,923
I wrote a Java program to find it:
The program uses brute force by starting with the lower bound obtained in the previous question (113,171,923,295) and finding the next prime that contains the required primes as substrings. It turns out that we only need to check 29628 possibilities, which is not many. Here is the program: https://pastebin.com/XQL6VGnc
$endgroup$
add a comment
|
$begingroup$
The answer is
113,171,952,923
I wrote a Java program to find it:
The program uses brute force by starting with the lower bound obtained in the previous question (113,171,923,295) and finding the next prime that contains the required primes as substrings. It turns out that we only need to check 29628 possibilities, which is not many. Here is the program: https://pastebin.com/XQL6VGnc
$endgroup$
add a comment
|
$begingroup$
The answer is
113,171,952,923
I wrote a Java program to find it:
The program uses brute force by starting with the lower bound obtained in the previous question (113,171,923,295) and finding the next prime that contains the required primes as substrings. It turns out that we only need to check 29628 possibilities, which is not many. Here is the program: https://pastebin.com/XQL6VGnc
$endgroup$
The answer is
113,171,952,923
I wrote a Java program to find it:
The program uses brute force by starting with the lower bound obtained in the previous question (113,171,923,295) and finding the next prime that contains the required primes as substrings. It turns out that we only need to check 29628 possibilities, which is not many. Here is the program: https://pastebin.com/XQL6VGnc
answered 1 hour ago
Dmitry KamenetskyDmitry Kamenetsky
9602 silver badges18 bronze badges
9602 silver badges18 bronze badges
add a comment
|
add a comment
|
Thanks for contributing an answer to Puzzling 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%2fpuzzling.stackexchange.com%2fquestions%2f89448%2fsmallest-prime-containing-the-first-11-primes-as-sub-strings%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$
This seems like it will be very difficult to do without a computer
$endgroup$
– Cruncher
8 hours ago
1
$begingroup$
How do you find any prime greater than the spoiler value without using a computer?
$endgroup$
– Weather Vane
8 hours ago
$begingroup$
@WeatherVane I compared my guesses to an already calculated List of primes. It was probably done with a computer, but not by me.
$endgroup$
– Darrel Hoffman
8 hours ago
$begingroup$
@DarrelHoffman I know (and have used) similar lists but didn't know they went that far.
$endgroup$
– Weather Vane
8 hours ago
2
$begingroup$
We should calculate the first N of these and submit it to the OEIS. I'll start: 2, 23, 253, 2357, 211573, 511327, 1135217... (trial and error on these, might not be all correct)
$endgroup$
– Darrel Hoffman
7 hours ago