Prove that if n is an odd integer, then there is a unique integer m such that n is the sum of m 2 and m + 3.

Compute gcd(60,36) by Euclids Algorithm (show the sequence of calls of the form gcd(a,b) that reduces to the solution) (e.g. gcd(18,8) reduces to gcd(8,2) reduces to gcd(2,0)---therefore gcd(18,8) = 2).

Calculate the prime factorization of 60 and calculate the prime factorization of 36.