**1.1 DIVISIBILITY :**

A non-zero integer **‘a’** is said to divide an integer **‘b’** if there exists an integer **‘c’** such that ** b= ac.** The integer **‘b’** is called dividend, integer **‘a’** is known as the divisor and integer **‘c’** is known as the quotient.

**For example, **5 divides 35 because there is an integer 7 such that 35 = 5 × 7.

If a non-zero integer **‘a’** divides an integer **b,** then it is written as **a | b ** and read as **‘a a divides b’, a/b** is written to indicate that **b** is not divisible by **a.**

**1.2 EUCLID’S DIVISION LEMMA : **

Let **‘a’** and **‘b’ **be any two positive integers. Then, there exists unique integers **‘q’** and **‘r’** such that **a = b + r, **where **0 $\le $ r b.** If **b|a,** than **r = 0.**

**Ex.1 **Show that any positive odd integer is of the form 6q + 1 or, 6q + 3 or, 6q + 5, where q is some integer.

**Sol. **Let ‘a’ be any positive integer and b = 6. Then, by Euclid’s division lemma there exists integers ’a’ and ‘r’ such that

a = 6q + r, where 0 $\le $ r < 6.

or a = 6q or, a = 6q + 1 or, a = 6q + 2 or, a = 6a + 3 or, a = 6q + 4 or, a = 6q + 5.

[ 0 $\le $ r < 6 Þ r = 0, 1,2,3,4,5]

hence a = 6q + 1 or, a = 6q + 3 or, a = 6q + 5.

[ a is an odd integer, \ \ 6q, a $\ne $ 6q + 2, a $\ne $ 6q + 4]

Hence, any odd integer is of the form 6q + 1 or, 6q + 3 or, 6q + 5.

**Ex.2 **Use Euclid’s Division Lemma to show that the cube of any positive integer is of the form 9m, 9m + 1 or 9 m + 8, for some integer q.

**Sol, **Let x be any positive integer. Then, it is of the form 3q or, 3q + 1 or, 3 + 2.

**Case – I **When x = 3q

this implies x3 = (3q)3 = 27q3 = 9(3q3) = 9m, where m = 9q3

**Case – II** when x = 3q + 1

Þ x3 = (3q + 1)3

Þ x3 = 2q3 + 27q2 + 9q + 1

Þ x3 = 9q (3q2 + 3q + 1) + 1

Þ x3 = 9m + 1, where m = q (3q2 + 3q + 1).

** Case -III **when x = 3q + 2

Þ x3 = (3q + 2)3

Þ x3 = 27q3 + 54q2 + 36q + 8

Þ x3 = 9q(3q2 + 6q + 4) + 8

Þ x3 = 9m + 8, where m = 3q2 + 6q + 4)

Hence, x3 is either of the form 9m of 9m + 1 or 9m + 8.

**Ex.3** Prove that the square of any positive integer of the form 5q + 1 is of the same form.

**Sol.** Let x be any positive’s integer of the form 5q + 1.

When x= 5q + 1

x2 = 25q2 + 10q + 1

x2 = 5(5q + 2) + 1

Let m = q (5q + 2).

x2 = 5m + 1.

Hence, x2 is of the same form i.e. 5m + 1.

**1.3 EUCLID’S DIVISION ALGORITHM :**

If **‘a’** and **‘b’ **are positive integers such that **a = bq + r,** then every common divisor of **‘a’ **and **‘b’** is a common divisor of **‘b’ **and **‘r’** and vice-versa.

**Ex.4** Use Euclid’s division algorithm to find the H.C.F. of 196 and 38318.

**Sol. **Applying Euclid’s division lemma to 196 and 38318.

38318 = 195 × 196 + 98

196 = 98 × 2 + 0

The remainder at the second stage is zero. So, the H.C.F. of 38318 and 196 is 98.

**Ex.5 **If the H.C.F. of 657 and 963 is expressible in the form 657x + 963 × (-15), find x.

**Sol.** Applying Euclid’s division lemma on 657 and 963.

963 = 657 × 1 + 306

657 = 306 × 2 + 45

306 = 45 × 6 + 36

45 = 36 × 1 + 9

36 = 9 × 4 + 0

So, the H.C.F. of 657 and 963 is 9.

Given : 657x + 963 × (-15) = H.C.F. of 657 and 963.

657 x + 963 × (-15) = 9

657 x = 9 + 963 × 15

657 x = 14454

$x=\frac{14454}{657}=22.$

**Ex.6** What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1, 2 and 3 respectively.

**Sol.** Clearly, the required number is the H.C.F. of the number 626 – 1 = 625, 3127 – 2 3125 and 15628 – 3 = 15625.

15628 – 3 = 15625.

Using Euclid’s division lemma to find the H.C.F. of 625 and 3125.

3125 = 625 × 5 + 0

Clearly, H.C.F. of 625 and 3125 is 625.

Now, H.C.F. of 625 and 15625

15625 = 625 × 25 + 0

So, the H.C.F. of 625 and 15625 is 625.

Hence, H.C.F. of 625, 3125 and 15625 is 625.

Hence, the required number is 625.

**Ex.7** 144 cartons of coke cans and 90 cartons of Pepsi cans are to be stacked is a canteen. If each stack is of same height and is to contains cartons of the same drink, what would be the greatest number of cartons each stack would have ?

**Sol.** In order to arrange the cartons of the same drink is the same stack, we have to find the greatest number that divides 144 and 90 exactly. Using Euclid’s algorithm, to find the H.C.F. of 144 and 90.

144 = 90 × 1 + 54

90 = 54 × 1 + 36

54 = 36 × 1 + 18

36 = 18 × 2 + 0

So, the H.C.F. of 144 and 90 is 18.

Number of cartons in each stack = 18.

**1.4 FUNDAMENTAL THEOREM OF ARITHMETIC :**

Every composite number can be expressed as a product of primes, and this factorisation is unique, except for the order in which the prime factors occurs.

## SOME IMPORTANT RESULTS :

(i) Let ‘p’ be a prime number and ‘a’ be a positive integer. If ‘p’ divides a2, then ‘p’ divides ‘a’.

(ii) Let x be a rational number whose decimal expansion terminates. Then, x can be expressed in the form $\frac{p}{q},$ where p and q are co-primes, and prime factorisation of q is of the form 2m × 5n, where m, n are non-negative integers.

(iii) Let $x=\frac{p}{q}$ be a rational number, such that the prime factorisation of q is not of the form 2m × 5n where m, n are non – negative integers. Then, x has a decimal expansion which is non – terminating repeating.

**Ex.8** Determine the prime factors of 45470971.

**Sol. **

** **so, 45470971 = 72 × 132 × 172 × 19.

**Ex.9** Check whether 6^{n} can end with the digit 0 for any natural number.

**Sol.** Any positive integer ending with the digit zero is divisible by 5 and so its prime factorisations must contain the prime 5.

6^{n }= (2 × 3)^{n} = 2^{ n} × 3^{ n}

Þ The prime in the factorisation of 6^{ n} is 2 and 3.

Þ 5 does not occur in the prime factorisation of 6^{n} for any n.

Þ 6^{ n} does not end with the digit zero for any natural number n.

**Ex.10** Find the LCM and HCF of 84, 90 and 120 by applying the prime factorization method.

**Sol.** 84 = 22 × 3 × 7, 90 = 2 × 32 × and 120 = 23 × 3 × 5.

Prime factors | Least exponent |

2 | 1 |

3 | 1 |

5 | 0 |

7 | 0 |

\ HCF = 21 × 31 = 6.

Common prime factors | Greatest exponent |

2 | 3 |

3 | 2 |

5 | 1 |

7 | 1 |

\ LCM = 2 3 × 33 × 51 × 71

= 8 × 9 × 5 × 7

= 2520.

**Ex.11** In a morning walk three persons step off together, their steps measure 80 cm, 85 cm and 90 cm respectively. What is the minimum distance each should walk so that they can cover the distance in complete steps ?

**Sol.** Required minimum distance each should walk so, that they can cover the distance in complete step is the L.C.M. of 80 cm, 85 cm and 90 cm

80 = 24 × 5

85 = 5 + 17

90 = 2 × 32 × 5

LCM = 24 × 32 × 51 × 171

LCM = 16 × 9 × 5 × 17

LCM = 12240 cm, = 122 m 40 cm.

**Ex.12 **Prove that $\sqrt{2}$ is an irrational number.

**Sol.** Let assume on the contrary that $\sqrt{2}$ is a rational number.

Then, there exists positive integer a and b such that

$\sqrt{2}=\frac{a}{b}$where, a and b are co primes i.e. their HCF is 1.

Þ ${{(\sqrt{2})}^{2}}={{\left( \frac{a}{b} \right)}^{2}}$

Þ $2=\frac{{{a}^{2}}}{{{b}^{2}}}$

Þ a2 = 2b2

Þ a2 is multiple of 2

a is a multiple of 2 ….(i)

Þ a = 2c for some integer c.

Þ a2 = 4c2

Þ 2b2 = 4c2

Þ b2 = 2c2

Þ b2 is a multiple of 2

b is a multiple of 2 ….(ii)

From (i) and (ii), a and b have at least 2 as a common factor. But this contradicts the fact that a and b are co-prime. This means that $\sqrt{2}$ is an irrational number.

**Ex.13** Prove that $3-\sqrt{5}$ is an irrational number.

**Sol.** Let assume that on the contrary that $3-\sqrt{5}$ is rational.

Then, there exist co-prime positive integers a and b such that,

$3-\sqrt{5}=\frac{a}{b}$

Þ $3-\frac{a}{b}=\sqrt{5}$

Þ $\frac{3b-a}{b}=\sqrt{5}$

Þ $\sqrt{5}$ is rational [\ a,b, are integer \ $\frac{3b-a}{b}$ is a rational number]

This contradicts the fact that $\sqrt{5}$ is irrational

Hence, $3-\sqrt{5}$ is an irrational number.

**Ex.14 **Without actually performing the long division, state whether $\frac{13}{3125}$ has terminating decimal expansion or not.

**Sol.** $\frac{13}{3125}=\frac{13}{{{2}^{0}}\times {{5}^{5}}}$

This, shows that the prime factorisation of the denominator is of the form 2^{m} × 5^{n}.

Hence, it has terminating decimal expansion.

**Ex.15** What can you say about the prime factorisations of the denominators of the following rationals :

(i) 43.123456789 (ii) 43.$\overline{123456789}$

**Sol.** (i) Since, 43.123456789 has terminating decimal, so prime factorisations of the denominator is of the form 2^{m} × 5^{n}, where m, n are non – negative integers.

(ii) Since 43.$\overline{123456789}$ has non-terminating repeating decimal expansion. So, its denominator has factors other than 2 or 5.