Divisibility Theory and Canonical 3.

51
Decompositions
since b
Sinceb is a positive integer,

b12 b=1 or 2.
ELAMPLE 11

sfa.b are odd positive integers, prove that

21a2+ b2 but 4 a? + b.
Solution.

Given a and b are odd positive integers.

Then a 2m + 1 and b = 2n + 1,
where m, n are integers 2 0.

a+b= (2m +12+(2n +1

= 4m2+4m+1+4n+4n+1
= 4m2+4n2+4m +4n+2
2(2m2+2n2+2m+2n +1)
21a+b, but 4Ja+ b? [ 2m2+ 2n2+2m + 2n+1 is an odd integer]

EXAMPLE 12
Prove that the product of any two integers ofthe form 4n+ 1 is also the same form.

Solution.
Let a = 4m + 1,b=4n + 1 be two integers.
To prove ab is of the form 4n + 1.

Then a b=(4m +1) (4n +1)

= 1 6mn +4 m+4n+l

= 4 (4 mn + m +n)+1|

4k+1,
Which is of the same form.
Hence ab is ofthe form 4n +1.

3.8 LEAST cOMMON MULTIPLE (LCM)

a and b 1s the smallest positive
of two positive integers
Definitlon 3.11 The least common multiple
and b.
eger that is divisible by botha
lcm ofa and b is denoted by
[a, b] or locm(a, b).
he decomposition to
find lcm.
we can use canonical
where a,
B are non-negative integers.
= and b= p PPR,
af
a=p pP2PR
p.p
Then max(a).max(az.B2)...max(a, B)
P2
[a,b]=Pi
 3.52 Aigebra and Number Theory

WORKED EXAMPLES

EXAMPLE 1
Find the lem of 1050 and 2574.

Solution. 2 1050 2 2574

We have to find lem of 1050 and 2574.
First we find the canonical decompositions.
525 3 1287
105 3 4429
1050 2 3 52.7 2.3 52.7. 119. 130 3 21 11 143
and 2574 2 32.11 13=2 32.50.70. 11-13 7 13
the lcm(a, b) = product of factors with maximum indices.

[a,b]=2.32.52.7 11 13

450, 4550

EXAMPLE 2
Find the lem of 120 and 500.

Solution.
We have to find lem of 120 and 500.
2 120 2 500
First we find the canonical decompositions.
2 60 2 250

120 23 3.5=23.3 5
2 30 s125
and 500 22 53 =22.30.53 15
the lcm[120, 500] = factors with maximum of the indices

[120,500]=23.3.53
3000
EXAMPLE 3
Find the gcd and lem of 504 and 540.

Solution. 2 504 2 540

We have to find gcd and lcm of 504 and 540.
2 252 2 270
First we find the canonical decompositions.
2 126 3 135
504 2 33.7=2.32.50.7 63 3 45

and 540=22.3.5=22.3.5.70 321 3 15

gcd (504, 540) = factors with minimum powers

22.32 36
 Divisibility Theory and Canonical
Decompositions 3.53
lem (504, 540) factors with
=

maximum powers
=23.33.5.7
= 7560

Theorem 3.16 If a and b are

positive integers, then
,b- b(a,b)
(a,b)
Proof Let
a=p P2.Pand b=
Then
pp.be the canonical decompositions of a andb.
(a, b) p =
)pin a-P3) . min.B;)
and a, b]= pmax( 5}).max(a2,B)
P2 4)max(a,.B;)
Pk
(a, b) [a, b] =
min{G)+ max(Gi.). min(%,8) +max(a,,B,) min ,B)+ max(a,B)
Pk

=ab

Note
a,ba.b)
. This theorem
2. Ifa andb are
gives another method for finding lcm.
relatively prime, then (a, b) =1|
[a,b]= =a-b
1
Thus lem of
relatively prime numbers is their product.
EXAMPLE 4
Find the lem of 504 and 540
using their ged.
Solution.
We have to find the lcm of 504 and 540.
First we find the canonical
decompositions.
Now 504 2 32
and
540 22 3.5
gcd (504, 540) = 22 32 = 36

Iem [504, 540] =504 540 =

14.540 =
7560
36
3.54 Algebra and Number Theory

EXAMPLE 5
Use recursion to evaluate [24, 28, 36, 40]

Solution. 2 24,28
We have to find [24, 28, 36, 40].
We isolate each term from the right and find the lcm of the inner 2 12,14
groups as below 6,7-Nocommon
factor
[24, 28, 36, 40] =
[[24,28,36].40
2 168,36
-L[124,28],36].40] 2 84, 18
But [24,28] =2.2 6.7= 168
3 42,9
[l24,28.36]= [168,36] 14,3-Nocommon
2-2-3-14-3 504 factor

[24, 28, 36, 40] [504, 40] 2 504, 40

2 252, 20
= 23.5 63
2 126, 10
2520
63, 5 No common
factor
EXAMPLE 6
Use recursion to find [15, 18, 24, 30].

Solution.
We have to find [15, 18, 24, 30].
We isolate each term from the right and find the lem of the inner groups as below

[15, 18, 24,30] =[[15,18,24].30 3 90,24 3 15, 18

-[[1s,18,24].30 2 30,8 5,6
But 15, 4 No common
[15, 18]=3.5 6 90 factor

[15,18].24]= [90,24]
= 3.2.15.4 360

[15, 18, 24, 30] = [360, 30]

360 : 30 is a factor of 360]

EXAMPLE7
Find the positive integer a if la, a + 1]= 132. IAU 20171

Solution.
Given
a,a +1]= 132
 Divisibility Theory and Canonical Decompositions 3.55

Since a and a + 1 are consecutive integers, they are relatively prime.

(a, a + 1)= 1|
Hence a, a +1]=a(a + 1) [by note in page 3.53]
132 a (a + 1)

a (a+ 1)= 11 12
a= 11

We now state a result concerning n!

Ifp is a prime and p|n!, then the highest power ofp dividing n! in its canonical decomposition is

It is a finite sum because

= 0 if p">n.

EXAMPLE 8
Find the canonical decomposition of 23!

Solution.
The primes dividing 23! are
2,3,5,7, 11, 17, 19,23. [ 23! = 1 2.3 4 5.6 7... 23]

The power of 2 dividing 23! is

=11+5+2+1 19

The power of 3 dividing 23! is = (:3 >23)

7+2 =9
The power of 5 dividing 23! is :

The power of 7 dividing 23! is =

The power of 11 dividing 23! is =

The power of 13 dividing 23! is =

The power of 17 dividing 23! is

3.56 Algebra and Number Theory

The powerof 19 dividing 23! is =

The power of 23 dividing 23! is =

the canonical form of 23! =21°.3.54.73. 112.13. 17 19 23

EXAMPLE 9

Find the largest power of 2 that divides 97!

Solution.
We know 2 |97!
the largest power of 2 dividing 97! is

15FEFE|EFEE)
48 +24+12 +6+3+1=94
2% is the highest power of 2 dividing 97!

EXAMPLE 10
Find the number of trailing zeros in the decimal value of 260

Solution.
The number ofzeros in which 260! is ending with is the same as the highest power of 10 dividing 260!
Now 10 2.5
10" =2m.5m
. the highest power of 10 is the same as highest power of 5.
The highest power of 5 dividing 260! is

= 52+10+2 = 64

100 is the highest power of 10 dividing 260!

the number of zeros in the decimal form of 260! is 64.
In the other words, 260! ends 64 zeros.

Note If we find the highest power 2 contained in 260!, then we get

= 258

Min {258, 64) = 64.

So, it is enough we find the power of 5.
 Divisibility Theory and Canonical Decompositions 3.57
EXAMPLE 11

find the number of

trailing zeros in 234!
Solutlon.
The number of zeros in which 234! is
ending with is the same as the highest power of 10 dividing 234!
Now
10 2.5
So, thehighest power of 10 is the same as the
The highest power of 5
highest power of 5 dividing 234!
dividing 234! is

:5234)
= 46+9+1= 56

264! ends with 56 zeros.

EXERCISE 3.2
1. Use the Euclidean algorithm to find the gcd ofthe following pairs of integers.
() 1024, 1000 (ii) 2076, 1076
(i) 2024, 1024 (iv) 1947, 63
2. Express gcd as a liner combination of the two given numbers.
G) 2076, 1776 (11) 414, 662
(ii) 3076, 1976 (iv) 1820, 231
3. Use recursion to find the gcd of the given numbers.
i) (16, 20, 36, 48) (i) (28, 48, 68, 78)
(ii) (14, 18, 21, 36, 48) (iv) (12, 17, 31, 37)
4. Find the canonical decomposition of:
) 1771 ii) 1001
(iii) 729 (iv) 7007
S. Find the lcm of
(i) 123, 243 i ) 1000, 625

Cii) 22.3 s,25.33.52 (iv) 2.3-5.7.11-13, 23.111714

6. Find the number of trailing zeros in the decimal value of 1400!

ANSWERS TO EXERCISE 3.2

(ii) 4 (ii) 8 (iv) 3

1. i) 8
2 G) 12= 83(1776)+(-71) (2076)
(11) 2= 8(414) + (-5) (662)
(ii) 4=-97(3076) + 151 (1976
(iv) 7 8(1820) + (-63) (231) (ii) 1 (iv)
3. (i) 4 (ii) 2
(ii) 7.11 13 (ii) 36
4. i) 7 11 23
(ii) 5000
ii) 23 3.53 iv) 2.3".5.7.11.13.1714
5. (i) 9963
6. 349
3.58 Algebra and Number Theory

PARTA QUESTIONS AND ANSWERSs

1. State the division algorithm for two integers a and b, where b> 0.

and r are integers such 0 r<b.

Ans. a =qb+r, where q
2. Find the quotient and remainder in the division algorithm when -23 is divided by 5.

Ans. -23 =-5 (5) +2, 0<2<5.

the quotient q = -5, remainder r = 2

3. Ifalb and a l c then a |-2c +3b-True and false.

Ans. True.
a lb, a | c b=la and c = ma for some integers c and m.

Now-2c+ 3b=-2(ma) +3 (la)

= -2m+3/) a a|-2c + 3b.

4. Find the number of positive integers S 2076 that are divisible by 19.

Ans.Thenumber of positive integers s2076 and divisibleby 19 is =a=[109.26=109

5. If the square of an integer is even, prove that the integer is even.

Ans. Let n be an integer such that n is even To prove n is even.

Suppose n is odd, then n = 2m + 1 for some integer m.

. n =(2m + 1)? =4m2 +4m +1
= 2 (2m + 2m)+ 1, which is odd and hence contradicts the hypothesis.

our assumption is wrong. Hence n is even.

6. Find the number of positive integers S 2076 that are divisible by neither 4 nor 5. [AU 2013, 17
Ans. Refer worked example 2, page 3.7.
7. Find the ged of 168 and 180 using the canonical decomposition. [AU 20171
Ans. Refer worked example 4, Page 3.41.

8. Find the canonical decomposition of 29- 1. AU 20171

Ans. 291 =511 =7 73
9. Ifa lband c|d prove that ac | bd.
Ans. Given a |b>b= ma

and cld^d= nc for some integers m, n.

bd =ma nc (mn) ac
= ac
| bd.
 3.59
Divisibility Theory and Canonical Decompositions
10. Express (10110), in base 10.
Ans. (10110), =1(24) +0 (23) 1(22) + + 1(2) + 0(20)
= 16+4 +2 22
11. Express (1776)% as a decimal number.
Ans. (1776) = 1(83) +7 (8) + 7(8) +6(8°)
= 1022
12. What are the digits and symbols used in the hexadecimal represe
Ans. The 16 symbols are 0, 1,2,3, 4, 5, 6, 7, 8,9, A, B, C, D, E, F, where A, B, C, D, E. F represent
10, 11, 12, 13, 14, 15 respectively.
13. Write 111010wo as an octal integer.
Ans. Refer worked example 2, Page 3.20.
14. Write (1110101), as a hexadecimal number.
Ans. Refer example 2, Page 3.21.
15. Find the value of the base b if
54, = 64.
Ans. Given 54, = 64
5(b')+4(6°)=64
5b+4 64
5b 60 b=12
16. If (a, b) =
d, then prove that
Ans. Given (a, b) d^d=xa
=
+yb for some integers x, y.
Since (a, b) = d, d | a and d | b
(1)
b
andare
d
integers
17. Ifn
is a positive integer, then prove that ged (n, n+ 2)= I or 2.
Ans. We have 2 1 (n+2)
=
+ (-1)n
Let ged (n, n + 2) = d.
Since d is the smallest positive
integer that can be
expressed as a linear combination of
n+2, it follows that dS 2. n and
 3.60 Algebra and Number Theory
Further d|2^d= 1or 2.
gcd (n, n +2) = 1 or 2
18. Ifa, b,c are positive integers, prove that gcd (ca, cb) = c ged (a, b).
Ans. Let d =(a, b), then d=xa +yb for some integers x andy.
dc =
(xa)c +
(yb)e
=
x(ac) + y(bc) (ac, bc)
=
c ( a , b) = (ac, bc)
19. I f(a, b) = 1 then prove that (a +b, a - b) = 1 or 2.
Ans. Let d =(a +b, a-b)
Then d a+b and d | a-b.
d
.. | (a +b) + (a- b)and d | (a + b) - (a-b)
d | 2a and d | 2b
d l gcd (2a, 2b)
But we know gcd (2a, 2b) = 2 gcd(a, b) [Refer example 18 Part A
2.1 2 [ged (a, b) =1]
d 2 d = 1 or 2
20. If (a,b)=3 and ab = 693 find (a, b].
Ans. We know that
Ja,b a-b = 693 231
(a,b) 3
21. Find the positive integer a if [a, a + 1]= 132. [AU 20171
Ans. Refer example 7, Page 3.54.
22. Ifa and b are positive integers with a =231, (a, b) =7 and
(a, bl 600060, find
=
b.
a b
Ans. We know that a, b|
231 b
60060=
b= 60060xT-1820
231
23. If (a, b) [a, b], what can you say about the relation between a
=
and b.
Ans. If (a, b) =[a, b] then the only possibility is a =b.
 Divisibility Theory and Canonical Decompositions 3.61
24. If ab 156, anda and b are
=
relatively prime find [a, b].
Ans. Given a and b are
relatively prime.
(a,(a, b) =
1.
b
We know that [a, b] =
a 156
|56
= 156
(a, 6) 1
25. The lem of two consecutive
positive integers is 812. Find the numbers.
Ans. Leta and a +1 be
the consecutive integers.
Then a and a + 1
relatively prime.
are
(a,(a, a + 1) =1.
Given [a, a+ 1] = 812
ala+)-812
(4,a+1)
aa + 1)= 812
But 812 22.7 29 2 812
2 8 29 2 406
a(a + 1)=28 29 203
Hence a = 28. 29
26. Ifa and b are positive
integers with a b=24.34.53.7.113.13.
and[a, b]=22.33 52.7.112.13 what is (a, b)?
Ans. Given a b=24.34.53.7 113. 13
and a, b]=22.33.52.7. 112.13
ab
We knoww l a , b]
(a, b)
(a,b)=b
[a, b]
2.34.53-7.11 13
22.33 52.7.112-13
2.3-5.11 330