Show that m is composite if a and m are integers greater than 1, and m is odd. [Hint: show that x-1 is a factor of the polynomial x^m-1 if m is odd.]

a) Apply Fermat's Little Theorem
b) Use the Fundamental Theorem of Algebra
c) Prove by mathematical induction
d) Utilize the Euclidean Algorithm