(10 points)
The Collatz conjecture is one of the most famous unsolved problems in Mathematics. It’s quite easy to state and understand but it has eluded proof for 85 years. Here’s the conjecture:
Given a positive integer a_0, define a sequence (a_i)_{i=0}^{\infty} recursively as follows:
First, a_0 is already chosen. Then, for i>0, leta_i = \begin{cases} 3 a_{i-1} + 1 & \text{if }a_{i-1} \text{ is odd} \\ a_{i-1}/2 & \text{if }a_{i-1} \text{ is even}. \end{cases}The conjecture asks if this sequence always lands on the number 1.
Here’s an illustration of the orbit of 3, for example:
You should be able to check these values easily enough.
Your problem:
Use the table below to find an a_0 to generate the resulting Collatz sequence. Then respond to this question with
- The resulting sequence and
- The number of multiplications or divisions required to generate the sequence - until it reaches 1.
- The number of additions required to generate the sequence.
- A brief explanation of how you got your results.
name | a_0 |
---|---|
Amanda | 5 |
Anna | 6 |
Benjamin | 10 |
Christian | 12 |
Elida | 13 |
Jared | 20 |
Kasey | 21 |
Matthew | 24 |
Nicholas | 26 |
Patt | 32 |