 is divisible by
 is divisible by  whenever
 whenever 
Lemma: there exists non-negative integer q such that
 Proof:
By a factorization theorem
Proof:
By a factorization theorem  can be factored as:
 can be factored as:
 where there are k terms in the second parentheses
where there are k terms in the second parentheses
 Therefore
Therefore 



 or there exists positive integer q such that
or there exists positive integer q such that
 Thus the lemma is proved.
Thus the lemma is proved.
 where there are n-1 terms in the parentheses on the right.
Now we wish to show that
where there are n-1 terms in the parentheses on the right.
Now we wish to show that
 is a positive integer.  Factoring the numerator:
 is a positive integer.  Factoring the numerator:
 
 
 
 By the lemma, there exist
By the lemma, there exist  ,
, ,...
,... so
that the preceding expression equals
 so
that the preceding expression equals



 


 since there are
since there are  terms this becomes:
 terms this becomes:


 or
or

 ,
which is a positive integer.
Edwin
,
which is a positive integer.
Edwin