exercise
Let a and b be natural integers such that 0<a<b.
1. Show that if a divides b, then for any naturel
number n, n^a −1 divides n^b −1.
2. For any non−zero naturel number n, prove
that the remainder of the euclidean division of
n^b −1 by n^a −1 is n^r −1 where r is the remainder
of the euclidean division of b by a.
3. For any non−zero naturel number n, show
that gcd(n^b −1, n^a −1) = n^d −1 where d = gcd(b,c).
by professor henderson^(−) .
|