• 0

Number Pattern Game

Question

Posted · Report post

Pick any positive integer.

If you pick an odd positive integer then your next picked number is 3n+1

If you pick an even number then your next picked number is n/2

Repeat with your picked numbers until you notice something interesting.

1. What interesting event happens?

2. Why is it happening?

3. Can you prove your hypothesis in number 2?

0

Share this post


Link to post
Share on other sites

7 answers to this question

  • 0

Posted · Report post


i picked : then picked ..... interesting
1:4 3:10 5:16 7:22 9:28 +6 every next odd
2:1 4:2 6:3 8:4 10:5 +1 every next even


0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

we will end up in 1, 4, 2, 1 cycle whatever n we choose?

0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

we will end up in 1, 4, 2, 1 cycle whatever n we choose?

yes. now we need to answer the last two questions

0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

i picked : then picked ..... interesting

1:4 3:10 5:16 7:22 9:28 +6 every next odd

2:1 4:2 6:3 8:4 10:5 +1 every next even

If you keep repeating (more than a single recurssion) you should come to the same conclusion as Barcallica.

0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

This is a "famous" unsolved problem. The conjecture that every positive integer eventually leads back to 1 is called the Collatz conjecture. We won't be able to prove or disprove it here, sorry :P

0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

It has not been proved, but most mathematicians believe this sequence eventually reaches the value of unity.
Thereafter it repeats 4 2 1 ..
.


A proof would rule out two alternatives.
  1. A cycle other than 4 2 1 ... exists
  2. The sequence is unbounded.

Four other cycles are known if the starting integer can be negative.

Strong heuristic arguments suggest the sequence is always bounded.

No other cycle has been found for starting numbers up to ~ 5x1018.

An interesting way to create the sequence in binary is to append a trailing "1" and add, then remove all trailing zeros.

For a starting point of 7(10) = 1 1 1(2), this gives

111
1111
10110
10111
100010
100011
110100
11011
101000
1011
10000

0

Share this post


Link to post
Share on other sites
  • 0

Posted · Report post

This is a "famous" unsolved problem. The conjecture that every positive integer eventually leads back to 1 is called the Collatz conjecture. We won't be able to prove or disprove it here, sorry :P

:thumbsup: I was hoping the fabulous minds at Brainden could pull together. Oh well.

0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now

  • Recently Browsing   0 members

    No registered users viewing this page.