Playing Doublets with the PrimesDeleting any digit yields a prime… is there a name for this?Probability with PrimesIs there a graph with these properties?Need help with formula for generating primesPrimes from the given setGenerating pairs of primes from the 2 previous primes.Palindromic Numbers - Pattern “inside” Prime Numbers?Primes with degree oneNT Divisibility with PrimesPrime number construction game
My large rocket is still flipping over
Collision domain question
How to say something covers all the view up to the horizon line?
What would happen if I combined this polymer and this metal (assuming I can)
Efficient deletion of specific list entries
Huffman Code in C++
Primes in a Diamond
How long does it take a postcard to get from USA to Germany?
How to preserve a rare version of a book?
How can I finally understand the confusing modal verb "мочь"?
Why is the blank symbol not considered part of the input alphabet of a Turing machine?
How did the Apollo guidance computer handle parity bit errors?
What is a common way to tell if an academic is "above average," or outstanding in their field? Is their h-index (Hirsh index) one of them?
Hostile Divisor Numbers
The selling of the sheep
Debian 9 server no sshd in auth.log
How is Pauli's exclusion principle still valid in these cases?
Can a player choose to add detail and flavor to their character's spells and abilities?
What does のそ mean on this picture?
What does the phrase "go for the pin" mean here?
A 2-connected graph contains a path passing through all the odd degree vertices
Dimmer switch not connected to ground
Gerrymandering Puzzle - Rig the Election
How do I download programs on Linux?
Playing Doublets with the Primes
Deleting any digit yields a prime… is there a name for this?Probability with PrimesIs there a graph with these properties?Need help with formula for generating primesPrimes from the given setGenerating pairs of primes from the 2 previous primes.Palindromic Numbers - Pattern “inside” Prime Numbers?Primes with degree oneNT Divisibility with PrimesPrime number construction game
$begingroup$
Lewis Carroll's famous game of Doublets is well known. In it you are asked to transform a given word into another by changing only one letter at a time, forming a genuine new word (not a proper name) with each letter change.
Doublets with primes is identical except that instead of playing with words you play with prime numbers, say two 3-digit primes.
Question 1. Can any 3-digit prime be transformed into any other 3-digit number following the Doublet rule?
Question 2. What is the longest distance (i.e. the largest number of links required) between two 3-digit primes?
One could ask the same questions about 4-digit primes.
graph-theory prime-numbers hamiltonian-path
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
$endgroup$
add a comment |
$begingroup$
Lewis Carroll's famous game of Doublets is well known. In it you are asked to transform a given word into another by changing only one letter at a time, forming a genuine new word (not a proper name) with each letter change.
Doublets with primes is identical except that instead of playing with words you play with prime numbers, say two 3-digit primes.
Question 1. Can any 3-digit prime be transformed into any other 3-digit number following the Doublet rule?
Question 2. What is the longest distance (i.e. the largest number of links required) between two 3-digit primes?
One could ask the same questions about 4-digit primes.
graph-theory prime-numbers hamiltonian-path
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
$endgroup$
add a comment |
$begingroup$
Lewis Carroll's famous game of Doublets is well known. In it you are asked to transform a given word into another by changing only one letter at a time, forming a genuine new word (not a proper name) with each letter change.
Doublets with primes is identical except that instead of playing with words you play with prime numbers, say two 3-digit primes.
Question 1. Can any 3-digit prime be transformed into any other 3-digit number following the Doublet rule?
Question 2. What is the longest distance (i.e. the largest number of links required) between two 3-digit primes?
One could ask the same questions about 4-digit primes.
graph-theory prime-numbers hamiltonian-path
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
$endgroup$
Lewis Carroll's famous game of Doublets is well known. In it you are asked to transform a given word into another by changing only one letter at a time, forming a genuine new word (not a proper name) with each letter change.
Doublets with primes is identical except that instead of playing with words you play with prime numbers, say two 3-digit primes.
Question 1. Can any 3-digit prime be transformed into any other 3-digit number following the Doublet rule?
Question 2. What is the longest distance (i.e. the largest number of links required) between two 3-digit primes?
One could ask the same questions about 4-digit primes.
graph-theory prime-numbers hamiltonian-path
graph-theory prime-numbers hamiltonian-path
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
asked 3 hours ago
Bernardo Recamán SantosBernardo Recamán Santos
410211
410211
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
$endgroup$
add a comment |
$begingroup$
For the first question the answer is yes, for the second question the answer is 6,
To solve the question i used both (Java and Wolfram), the idea is this i made a graph with nodes being the primes with 3-digits and there is a line between two nodes iff the primes representing the nodes are 1-Doublet(meaning with one digit change we can transfer one into another) and then we can state you question as graph theory question which are :
1) is the graph connected ?
2) what is the graph diameter ?
building the graph using Java and answering the questions using Wolfram we are done.
it seems that this is true for any number of digits primes, but i don't think there is a simple proof.
answered 1 hour ago
AhmadAhmad
2,1071725
$endgroup$
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
add a comment |
Your Answer
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%2f3215119%2fplaying-doublets-with-the-primes%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
$endgroup$
add a comment |
$begingroup$
I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
$endgroup$
add a comment |
$begingroup$
I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
$endgroup$
I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
answered 13 mins ago
Freddy BarreraFreddy Barrera
1563
1563
add a comment |
add a comment |
$begingroup$
For the first question the answer is yes, for the second question the answer is 6,
To solve the question i used both (Java and Wolfram), the idea is this i made a graph with nodes being the primes with 3-digits and there is a line between two nodes iff the primes representing the nodes are 1-Doublet(meaning with one digit change we can transfer one into another) and then we can state you question as graph theory question which are :
1) is the graph connected ?
2) what is the graph diameter ?
building the graph using Java and answering the questions using Wolfram we are done.
it seems that this is true for any number of digits primes, but i don't think there is a simple proof.
answered 1 hour ago
AhmadAhmad
2,1071725
$endgroup$
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
add a comment |
$begingroup$
For the first question the answer is yes, for the second question the answer is 6,
To solve the question i used both (Java and Wolfram), the idea is this i made a graph with nodes being the primes with 3-digits and there is a line between two nodes iff the primes representing the nodes are 1-Doublet(meaning with one digit change we can transfer one into another) and then we can state you question as graph theory question which are :
1) is the graph connected ?
2) what is the graph diameter ?
building the graph using Java and answering the questions using Wolfram we are done.
it seems that this is true for any number of digits primes, but i don't think there is a simple proof.
answered 1 hour ago
AhmadAhmad
2,1071725
$endgroup$
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
add a comment |
$begingroup$
For the first question the answer is yes, for the second question the answer is 6,
To solve the question i used both (Java and Wolfram), the idea is this i made a graph with nodes being the primes with 3-digits and there is a line between two nodes iff the primes representing the nodes are 1-Doublet(meaning with one digit change we can transfer one into another) and then we can state you question as graph theory question which are :
1) is the graph connected ?
2) what is the graph diameter ?
building the graph using Java and answering the questions using Wolfram we are done.
it seems that this is true for any number of digits primes, but i don't think there is a simple proof.
answered 1 hour ago
AhmadAhmad
2,1071725
$endgroup$
For the first question the answer is yes, for the second question the answer is 6,
To solve the question i used both (Java and Wolfram), the idea is this i made a graph with nodes being the primes with 3-digits and there is a line between two nodes iff the primes representing the nodes are 1-Doublet(meaning with one digit change we can transfer one into another) and then we can state you question as graph theory question which are :
1) is the graph connected ?
2) what is the graph diameter ?
building the graph using Java and answering the questions using Wolfram we are done.
it seems that this is true for any number of digits primes, but i don't think there is a simple proof.
answered 1 hour ago
AhmadAhmad
2,1071725
answered 1 hour ago
AhmadAhmad
2,1071725
answered 1 hour ago
AhmadAhmad
2,1071725
answered 1 hour ago
AhmadAhmad
2,1071725
2,1071725
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
add a comment |
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
2
2
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
Once we get to $6$ digits, the prime $294001$ has no neighbor primes, and the graph is disconnected. See weakly prime numbers.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
@MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
$endgroup$
– Ahmad
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
$begingroup$
For 4 digits, the longest distance is 8, between 2441 and 9199 (and other pairs). For 5 digits, the longest distance is 10, between 88259 and 99721.
$endgroup$
– Misha Lavrov
1 hour ago
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%2f3215119%2fplaying-doublets-with-the-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
