Question

Question 3:

(i) Prove by contradiction that for any integer n>1, n and n+1 do not have a

prime factor in common.

(ii) Explain why this implies that n(n+1) must have at least two distinct prime

factors.

(iii) What can you conclude about the number of distinct prime factors which

n(n+1)[n(n+1)+1] has?