Professional Documents
Culture Documents
Prove that
1.
Prove that, if
r satisfying a=qb+r
and
, where
2 b r 3 b
'
q and r
'
such that
'
q b+r
'
, where
0 r' b .
a=q' b+r '
Now
can be written as
(i)
Let
a=qb+r
.(ii)
'
Since
2 b r 3 b (proved)
i.e.
3 q or
or
3 q+1 .
3 k +1 or 3 k +2 .
If
a=3 k , then a2=9 k 2=3.3 k 2 , which is in the form a=3 q since 3 k 2 is an integer.
If
Again, if
form
a=3 k +2, then a2=(3 k +2)2=9 k 2+12 k + 4=3 ( 3 k 2 + 4+1 ) +1 , which is in the
a=3 q+1 , since 3 k 2 +4 +1 is an integer. Hence proved.
1. Prove that
2. If
By previous problem
So, if
3 a21=3 q or 3 q+1 .
2
3 a21=3 q , then 3 ( a q ) =1 , i.e. 1 is divisible by 3 . Which is is not possible.
Similarly if
2
3 a21=3 q+1 , then 3 ( a q ) =2 , which is also not possible.
2201. We begin by
noting
that 25 9 (mod 41), whence
other
words,
220 81 81 mod
254
41 . But
(9)4
81 1 mod
41 , and so 81 81 1
(mod 41).
we finally arrive at
20
2 1 81 811 11 0
Thus, 41 |
(mod
41
20
2 1 , as desired.
Example 4.3. For another example in the same spirit, suppose that we are asked to
find the remainder obtained upon dividing the sum
by 12. Without the aid of congruences this would be an awesome calculation. The
observation that starts us off is that
4 ! 24 0 mod
k ! 4 ! 5 6 k 0 5 6 k 0 mod
12 ; thus, for
k 4 ,
12
1! +2! +3 !+ 4 !+ +100 !
1 !+2 !+3 !+ 0+ +0 9( mod 12)
53103
10353
333111 is divisible
by 7.
6. For n 1, use congruence theory to establish each of the following divisibility
statements:
(a) 7 | 52n + 3 25n2.
(b) 13 | 3n+2 + 42n+1.
(c) 27 | 25n+1 + 5n+2.
(d) 43 | 6n+2 + 72n+1.
8. Prove the assertions below:
(a) If a is an odd integer, then a2 1 (mod 8).
(b) For any integer a, a3 0, 1, or 6 (mod 7).
(c) For any integer a, a4 0 or 1 (mod 5).
(d) If the integer a is not divisible by 2 or 3, then a2 1 (mod 24).