Show that if and doesn't divide then there is at least one prime
factor of such that .
so
How would you link p and q together so that q divides (p-1)? Thanks.
-------------------------------------------------------------------
Edit:
Would this be a good proof?
Using
because otherwise , which contradicts with the given conditions.
for some i between 0 and n because it is the only possible way that p divides but not m.
If q is a factor of m, then we can let q be for some i between 0 and n.
since , then we can substitute with q to get
, which can be expressed as