Directions: Use Maple for assistance in responding to the following problems. Please typeset your solutions. Explain what you have done. Maple session details are not necessary unless you think it important to include them. Accuracy is important.
Although you may refer to books and notes, you may not seek help from others on this written assignment.
Technical comments for this assignment:
You should not find it necessary to write your own programs to do this assignment if you are familiar with those found at http://www.math.albany.edu/~hammond/maple/.
The behavior of Maple's convert[confrac] appears to have changed between Maple 9 and Maple 10.
Let a and b be the integers
| a = 30246273033735921 b = 1363209853178907 . |
Answer the following questions:
Compute the quotient a/b with 50 digits of precision.
What is the remainder upon long division of a by b?
What is the greatest common divisor of a and b?
What is the prime factorization of b?
What number of iterations of the Syracuse function beginning with a is required to reach 1?
What is the largest iterate of the Syracuse function beginning with a?
What is the 20th remainder found in applying the Euclidean algorithm (successive long divisions) to a and b?
What are the two smallest primes found among the sequence of remainders coming from the Euclidean algorithm? N.B. The number 1 is not a prime.
How many integers appear in the continued fraction expansion of a/b.
What is the length of the repeating pattern in the decimal expansion of 208341/66317? (This is the 7-th convergent in the continued fraction expansion of pi.)