When
, we have


and of course 3 | 6. ("3 divides 6", in case the notation is unfamiliar.)
Suppose this is true for
, that

Now for
, we have

so we know the left side is at least divisible by
by our assumption.
It remains to show that

which is easily done with Fermat's little theorem. It says

where
is prime and
is any integer. Then for any positive integer
,

Furthermore,

which goes all the way down to

So, we find that

QED
This is what I did for factoring. Let me know if you need more work?
Answer:
12
Step-by-step explanation:
List out the factors of each
36: 1,2,3,4,6,9,12,18,36
60: 1,2,3,4,5,6,10,12,15,20,30,60
the highest number they both have in common is 12
Can you ask the full question please?
Answer:
12
Step-by-step explanation:
