(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
Your assignment is to track the number of operations involved in 5 Collatz steps. To do so, first determine a_0 by summing the positions of the letters in your name. Then respond to this question with
- The resulting sequence,
- The number of multiplications or divisions required to generate 5 steps in the sequence,
- The number of additions required to generate those same 5 steps in the sequence, and
- A brief explanation of how you got your results.
If summing the positions of the letters in your name is somehow too much of a chore, here’s a little form that will do it for you:
I won’t write the Collatz code for you but you are free to do so, if you would like!