Reference no: EM13872115
The 3n + 1 problem Background
Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.
The Problem
Consider the following algorithm:
1. input n
2. print n
3. if n = 1 then STOP
4. if n is odd then n ← 3n + 1
5. else n ← n/2
6. GOTO 2
Given the input 22, the following sequence of numbers will be printed
22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1
It is conjectured that the algorithm above will terminate (when a 1 is printed) for any integral input value. Despite the simplicity of the algorithm, it is unknown whether this conjecture is true. It has been verified, however, for all integers n such that 0 < n < 1, 000,000 (and, in fact, for many more numbers than this.)
Given an input n, it is possible to determine the number of numbers printed before and including the 1 is printed. For a given n this is called the cycle-length of n. In the example above, the cycle length of 22 is 16.
For any two numbers i and j you are to determine the maximum cycle length over all numbers between and including both i and j.
The Input
The input will consist of a series of pairs of integers i and j, one pair of integers per line. All integers will be less than 10,000 and greater than 0.
You should process all pairs of integers and for each pair determine the maximum cycle length over all integers between and including i and j.
The Output
For each pair of input integers i and j you should output i, j, and the maximum cycle length for integers between and including i and j. These three numbers should be separated by at least one space with all three numbers on one line and with one line of output for each line of input. The integers i and j must appear in the output in the same order in which they appeared in the input and should be followed by the maximum cycle length (on the same line).
Define the term security
: Define the term security and list (and discuss in detail) the five main security measures.Give some data in healthcare management
|
Maximizing investor losses
: Discuss the purpose for each, and suggest as least two (2) tax-planning strategies for ensuring that the IRS allows passive losses in order to reduce your tax liability
|
Question regarding the bernoulli effect
: If the wings have surface area of 1200m2, how fast must the air flow over the upper surface of the wing if the plane is to stay in the air? Consider only the Bernoulli effect.
|
How much interest expense would be reported on the income
: How much interest expense would be reported on the income statement for the year ending December 31, 2014? How would the balance of $375,201.09 at December 31, 2014 be reported on a balance sheet as of that date?
|
Analyzing a property of an algorithm
: Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible in..
|
Comparing two different capital structures-equity plan
: The NBA Corporation is comparing two different capital structures, an all-equity plan (Plan I) and a levered plan (Plan II). Under Plan I, NBA would have 200 shares of stock outstanding. Under Plan II, NBA would have 100 shares of stock and $5,000 in..
|
Evaluate the time interval required to empty
: (a) Show that the time interval required to empty the tank is given by (b) Evaluate the time interval required to empty the tank if it is a cube 0.500 m on each edge, if A = 2.00 cm2, and d = 10.0 m.
|
Create a program to print a battleship grid to the console
: Create a program to print a battleship grid to the console
|
Prepare journal entries to record acquisition of building
: Prepare the journal entries to record The acquisition of the building and inception of the mortgage loan payable and The first mortgage payment on June 30, 2014.
|