1. Let n=2^14 * 3^9 * 5^8 * 7^10 * 11^3 * 13^5 * 37^10.
a) how many divisors does n have?
b) how many divisors in a are divisible by m=2^3*3^4*5^7*11^2*37^2
(where n^m is n to the mth power and * = times)
2. Let m=8408400 and n=9316125
a) write m and n as a product of primes.
b. Without using the Euclidean Algorithm, find the greatest common divisor of m and n
3. Prove n is odd if and only if n^2+1 is even
4. Disprove: If n, m are perfect squares then n+m must be a perfect square
5. Use the Fundamental Theorem of Arithmetic to find the smallest interget n so that n * 1260 is a perfect cube
NOTE: i KNOW it's kind of scrambled and hard to read, but I didn't know what else to do. this is seriously killing me and the professor is impossible to understand in class.
2007-11-03
17:01:40
·
2 answers
·
asked by
Anonymous
in
Mathematics