Ttdfjt

My perfect evil overlord plan... or is it?

I might have messed up in the 'Future Work' section of my thesis

When do you stop "pushing" a book?

How come mathematicians published in Annals of Eugenics?

Names of the Six Tastes

Integral with DiracDelta. Can Mathematica be made to solve this?

Why use steam instead of just hot air?

Publishing an article in a journal without a related degree

What's the "magic similar to the Knock spell" referenced in the Dungeon of the Mad Mage adventure?

Is there an idiom that means "revealing a secret unintentionally"?

Is there an application which does HTTP PUT?

"Estrontium" on poster

Are on’yomi words loanwords?

Is it a good idea to copy a trader when investing?

Why are thrust reversers not used to slow down to taxi speeds?

Are wands in any sort of book going to be too much like Harry Potter?

How did Captain Marvel know where to find these characters?

Why is it wrong to *implement* myself a known, published, widely believed to be secure crypto algorithm?

What's the difference between "ricochet" and "bounce"?

Compactness in normed vector spaces.

Is there a need for better software for writers?

Why did they wait for Quill to arrive?

Does Thread.yield() do anything if we have enough processors to service all threads?

How is Arya still alive?

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

5

$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

share|cite|improve this question

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

$endgroup$

add a comment | 

5

$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

share|cite|improve this question

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

$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

share|cite|improve this question

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

$endgroup$

share|cite|improve this question

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

share|cite|improve this question

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

asked May 5 at 21:43

Bernardo Recamán SantosBernardo Recamán Santos

465211

2 Answers
2

active

oldest

votes

9

$begingroup$

I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:

share|cite|improve this answer

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  I would like this better if you included all edges somehow. Just including the edges for the (a?) Hamiltonian cycle suggests there aren't other edges. On the other hand, it would make the graph much more complicated.
  $endgroup$
  – Teepeemm
  May 6 at 1:30
  

  
  
  
  

add a comment | 

6

$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.

share|cite|improve this answer

answered May 5 at 23:11

AhmadAhmad

2,1521725

$endgroup$

• 
  
  
  

  
  6
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:35
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
  $endgroup$
  – Ahmad
  May 5 at 23:41
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:49
  
  

  
  
  
  

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
);



);

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

Name

Email

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

Name

Email

Required, but never shown

9

$begingroup$

I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:

share|cite|improve this answer

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  I would like this better if you included all edges somehow. Just including the edges for the (a?) Hamiltonian cycle suggests there aren't other edges. On the other hand, it would make the graph much more complicated.
  $endgroup$
  – Teepeemm
  May 6 at 1:30
  

  
  
  
  

add a comment | 

9

$begingroup$

I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:

share|cite|improve this answer

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

$endgroup$

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  $begingroup$
  I would like this better if you included all edges somehow. Just including the edges for the (a?) Hamiltonian cycle suggests there aren't other edges. On the other hand, it would make the graph much more complicated.
  $endgroup$
  – Teepeemm
  May 6 at 1:30
  

  
  
  
  

add a comment | 

$begingroup$

I can confirm that the corresponding graph is connected. Moreover, it has a hamiltonian cycle:

share|cite|improve this answer

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

$endgroup$

share|cite|improve this answer

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

answered May 6 at 0:52

Freddy BarreraFreddy Barrera

2163

6

$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.

share|cite|improve this answer

answered May 5 at 23:11

AhmadAhmad

2,1521725

$endgroup$

• 
  
  
  

  
  6
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:35
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
  $endgroup$
  – Ahmad
  May 5 at 23:41
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:49
  
  

  
  
  
  

add a comment | 

6

$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.

share|cite|improve this answer

answered May 5 at 23:11

AhmadAhmad

2,1521725

$endgroup$

• 
  
  
  

  
  6
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:35
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @MishaLavrov so for $4,5$ digits primes it works, i want to find what is the diameter!
  $endgroup$
  – Ahmad
  May 5 at 23:41
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $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
  May 5 at 23:49
  
  

  
  
  
  

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.

share|cite|improve this answer

answered May 5 at 23:11

AhmadAhmad

2,1521725

$endgroup$

share|cite|improve this answer

answered May 5 at 23:11

AhmadAhmad

2,1521725

answered May 5 at 23:11

AhmadAhmad

2,1521725

answered May 5 at 23:11

AhmadAhmad

2,1521725