Mrthdrb

Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?

Why are there no cargo aircraft with "flying wing" design?

Can a non-EU citizen traveling with me come with me through the EU passport line?

What happens to sewage if there is no river near by?

Does polymorph use a PC’s CR or its level?

IndentationError when pasting code in Python 3 interpreter mode

Did Kevin spill real chili?

3 doors, three guards, one stone

Do I really need recursive chmod to restrict access to a folder?

How do I stop a creek from eroding my steep embankment?

Why don't the Weasley twins use magic outside of school if the Trace can only find the location of spells cast?

Why is "Consequences inflicted." not a sentence?

Should I use Javascript Classes or Apex Classes in Lightning Web Components?

How to recreate this effect in Photoshop?

Is above average number of years spent on PhD considered a red flag in future academia or industry positions?

What does '1 unit of lemon juice' mean in a grandma's drink recipe?

Are variable time comparisons always a security risk in cryptography code?

How to draw this diagram using TikZ package?

Is the Standard Deduction better than Itemized when both are the same amount?

How can players work together to take actions that are otherwise impossible?

What's the purpose of writing one's academic bio in 3rd person?

Antler Helmet: Can it work?

When is phishing education going too far?

How can I make names more distinctive without making them longer?

Distance from One

1

$begingroup$

For random natural number $N_0 > 1$, we find $N_1$ by the rule:

$N_i+1 = fracN_i2$ if $N_i$ is even

$N_i+1 = 3N_i + 1$ if $N_i$ is odd

If $N_1$ isn't equal to $1$, we find $N_2$ by applying the same rule on $N_1$.

$N_0$ is at a distance $X$ from $1$, when after exactly $X$ applications of the rule, we get $1$ for the first time.

What's the amount of natural numbers at distance 61 from 1 ?

mathematics

share|improve this question

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  This stems from the $3n+1$ conjecture! $(+1)$ :D
  $endgroup$
  – user477343
  Apr 11 at 11:48
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Clarification needed: is the final question "what is the sum of all the natural numbers that are a distance of 61 from 1?", or does this mean "how many natural numbers are a distance of 61 from 1?"
  $endgroup$
  – Hugh
  Apr 11 at 21:03
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  It's asking how many (count)
  $endgroup$
  – Kradec na kysmet
  Apr 12 at 6:57
  

  
  
  
  

add a comment | 

1

$begingroup$

For random natural number $N_0 > 1$, we find $N_1$ by the rule:

$N_i+1 = fracN_i2$ if $N_i$ is even

$N_i+1 = 3N_i + 1$ if $N_i$ is odd

If $N_1$ isn't equal to $1$, we find $N_2$ by applying the same rule on $N_1$.

$N_0$ is at a distance $X$ from $1$, when after exactly $X$ applications of the rule, we get $1$ for the first time.

What's the amount of natural numbers at distance 61 from 1 ?

mathematics

share|improve this question

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  This stems from the $3n+1$ conjecture! $(+1)$ :D
  $endgroup$
  – user477343
  Apr 11 at 11:48
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Clarification needed: is the final question "what is the sum of all the natural numbers that are a distance of 61 from 1?", or does this mean "how many natural numbers are a distance of 61 from 1?"
  $endgroup$
  – Hugh
  Apr 11 at 21:03
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  It's asking how many (count)
  $endgroup$
  – Kradec na kysmet
  Apr 12 at 6:57
  

  
  
  
  

add a comment | 

$begingroup$

For random natural number $N_0 > 1$, we find $N_1$ by the rule:

$N_i+1 = fracN_i2$ if $N_i$ is even

$N_i+1 = 3N_i + 1$ if $N_i$ is odd

If $N_1$ isn't equal to $1$, we find $N_2$ by applying the same rule on $N_1$.

$N_0$ is at a distance $X$ from $1$, when after exactly $X$ applications of the rule, we get $1$ for the first time.

What's the amount of natural numbers at distance 61 from 1 ?

mathematics

share|improve this question

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

$endgroup$

share|improve this question

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

share|improve this question

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

edited Apr 11 at 11:15

jafe

26k475255

edited Apr 11 at 11:15

jafe

26k475255

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

asked Apr 11 at 11:00

Kradec na kysmetKradec na kysmet

918

1 Answer
1

active

oldest

votes

9

$begingroup$

I don't know if this is strictly a puzzle but more of a computational programming exercise.

Many people on this site will already be familiar with the iterative function in the set-up to this problem as that from the famous Collatz conjecture. As you would expect, much research has been conducted into the properties of this function and there is even an entry on OEIS which describes the number of numbers that are exactly $n$ steps away from $1$, see here.

The value for $61$ is not listed here but they do give functions in a few different languages to obtain the number of steps for arbitrary $n$, and, saying that, it's not terribly difficult to write one yourself, for which the result is

$$1040490$$

Some other interesting things

This is a nice graph from Wikipedia showing the numbers which are within $20$ steps of $1$: Also, the general pattern of the sequence tends to settle into exponential growth with ratio between adjacent terms thought to approach $frac3 + sqrt216$, which is something I didn't know before.

share|improve this answer

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The link you shared is for just 3*x + 1
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 11:51
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  @Kradecnakysmet It's sometimes called the "3x+1" problem but the set-up is as you've described.
  $endgroup$
  – hexomino
  Apr 11 at 11:53
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  How did you count it so fast, is there formula for it ?
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Here's one interesting way to look at this issue: once you hit 2^X, you are X steps away from 1. The only way to get to 1 is to be at 2, then 4, etc. So, really your somewhat random walk ends on any power of 2.
  $endgroup$
  – Jim
  Apr 11 at 18:40
  
  

  
  
  
  

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/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%2fpuzzling.stackexchange.com%2fquestions%2f81644%2fdistance-from-one%23new-answer', 'question_page');

);

Post as a guest

Name

Email

Required, but never shown

9

$begingroup$

I don't know if this is strictly a puzzle but more of a computational programming exercise.

Many people on this site will already be familiar with the iterative function in the set-up to this problem as that from the famous Collatz conjecture. As you would expect, much research has been conducted into the properties of this function and there is even an entry on OEIS which describes the number of numbers that are exactly $n$ steps away from $1$, see here.

The value for $61$ is not listed here but they do give functions in a few different languages to obtain the number of steps for arbitrary $n$, and, saying that, it's not terribly difficult to write one yourself, for which the result is

$$1040490$$

Some other interesting things

This is a nice graph from Wikipedia showing the numbers which are within $20$ steps of $1$: Also, the general pattern of the sequence tends to settle into exponential growth with ratio between adjacent terms thought to approach $frac3 + sqrt216$, which is something I didn't know before.

share|improve this answer

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The link you shared is for just 3*x + 1
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 11:51
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  @Kradecnakysmet It's sometimes called the "3x+1" problem but the set-up is as you've described.
  $endgroup$
  – hexomino
  Apr 11 at 11:53
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  How did you count it so fast, is there formula for it ?
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Here's one interesting way to look at this issue: once you hit 2^X, you are X steps away from 1. The only way to get to 1 is to be at 2, then 4, etc. So, really your somewhat random walk ends on any power of 2.
  $endgroup$
  – Jim
  Apr 11 at 18:40
  
  

  
  
  
  

add a comment | 

9

$begingroup$

I don't know if this is strictly a puzzle but more of a computational programming exercise.

Many people on this site will already be familiar with the iterative function in the set-up to this problem as that from the famous Collatz conjecture. As you would expect, much research has been conducted into the properties of this function and there is even an entry on OEIS which describes the number of numbers that are exactly $n$ steps away from $1$, see here.

The value for $61$ is not listed here but they do give functions in a few different languages to obtain the number of steps for arbitrary $n$, and, saying that, it's not terribly difficult to write one yourself, for which the result is

$$1040490$$

Some other interesting things

This is a nice graph from Wikipedia showing the numbers which are within $20$ steps of $1$: Also, the general pattern of the sequence tends to settle into exponential growth with ratio between adjacent terms thought to approach $frac3 + sqrt216$, which is something I didn't know before.

share|improve this answer

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The link you shared is for just 3*x + 1
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 11:51
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  $begingroup$
  @Kradecnakysmet It's sometimes called the "3x+1" problem but the set-up is as you've described.
  $endgroup$
  – hexomino
  Apr 11 at 11:53
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  How did you count it so fast, is there formula for it ?
  $endgroup$
  – Kradec na kysmet
  Apr 11 at 12:23
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Here's one interesting way to look at this issue: once you hit 2^X, you are X steps away from 1. The only way to get to 1 is to be at 2, then 4, etc. So, really your somewhat random walk ends on any power of 2.
  $endgroup$
  – Jim
  Apr 11 at 18:40
  
  

  
  
  
  

add a comment | 

$begingroup$

I don't know if this is strictly a puzzle but more of a computational programming exercise.

Many people on this site will already be familiar with the iterative function in the set-up to this problem as that from the famous Collatz conjecture. As you would expect, much research has been conducted into the properties of this function and there is even an entry on OEIS which describes the number of numbers that are exactly $n$ steps away from $1$, see here.

The value for $61$ is not listed here but they do give functions in a few different languages to obtain the number of steps for arbitrary $n$, and, saying that, it's not terribly difficult to write one yourself, for which the result is

$$1040490$$

Some other interesting things

This is a nice graph from Wikipedia showing the numbers which are within $20$ steps of $1$: Also, the general pattern of the sequence tends to settle into exponential growth with ratio between adjacent terms thought to approach $frac3 + sqrt216$, which is something I didn't know before.

share|improve this answer

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

$endgroup$

share|improve this answer

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221

answered Apr 11 at 11:42

hexominohexomino

47.1k4143221