Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a C++ program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants if you can do this using the while loop, the for loop, and the do..while loop if necessary that's would be great thanks
Suppose that the first number of a sequence is x, where x is a non-zero
positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1.
Write a C++
For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants if you can do this using the while loop, the for loop, and the do..while loop if necessary that's would be great thanks
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
