Douglas Hofstadter’s Pulitzer-prize-winning book Gödel, Escher, Bach contains many interesting mathematical puzzles, many of which can be expressed in the form of computer programs. In Chapter XII, Hofstadter mentions a wonderful problem that is well within the scope of the control statements from Chapter 4. The problem can be expressed as follows:

Pick some positive integer and call it n. If n is even, divide it by two. If n is odd, multiply it by three and add one. Continue this process until n is equal to one.On page 401 of the Vintage edition, Hofstadter illustrates this process with the following example, starting with the number 15:

15 is odd, so I make 3n+1: 46 46 is even, so I take half: 23 23 is odd, so I make 3n+1: 70 70 is even, so I take half: 35 35 is odd, so I make 3n+1: 106 106 is even, so I take half: 53 53 is odd, so I make 3n+1: 160 160 is even, so I take half: 80 80 is even, so I take half: 40 40 is even, so I take half: 20 20 is even, so I take half: 10 10 is even, so I take half: 5 5 is odd, so I make 3n+1: 16 16 is even, so I take half: 8 8 is even, so I take half: 4 4 is even, so I take half: 2 2 is even, so I take half: 1As you can see from this example, the numbers go up and down, but eventually—at least for all numbers that have ever been tried—comes down to end in 1. In some respects, this process is reminiscent of the formation of hailstones, which get carried upward by the winds over and over again before they finally descend to the ground. Because of this analogy, this sequence of numbers is usually called the Hailstone sequence, although it goes by many other names as well.

Write a ConsoleProgram that reads in a number from the user and then displays the Hailstone sequence for that number, just as in Hofstadter’s book, followed by a line showing the number of steps taken to reach 1. For example, your program should be able to produce a sample run that looks like this:

The fascinating thing about this problem is that no one has yet been able to prove that it always stops. The number of steps in the process can certainly get very large. How many steps, for example, does your program take when n is 27?

Read in the initial number and reset the step counter. As long as the number has not reached 1 continue processing. Check if the number is odd by comparing the modulo by 2 with 1, and create a temporary variable with the new value, print the the “odd” message and set the number to the new value. Accordingly calculate the new number for an even value, print the message and set the new value. After each iteration increase the step counter.

At the end print out the final message including the number of steps needed:

public void run() { int steps = 0; int number = readInt(&quot;Enter a number: &quot;); while (number != 1) { if (number % 2 == 1) { int temp = 3 * number + 1; println(number + &quot; is odd, so I make 3n+1: &quot; + temp); number = temp; } else { int temp = number / 2; println(number + &quot; is even, so I take half: &quot; + temp); number = temp; } steps++; } println(&quot;The process took &quot; + steps + &quot; steps to reach 1.&quot;); }

The code for this assignment is available on github.