EXERCISE 1.1
Question 1: Express each number as a product of its prime factors:
(i) 140
(ii) 156
(iii) 3825
(iv) 5005
(v) 7429
Solution-
(i) 140
140 = 2 × 70
140 = 2 × 2 × 35
140 = 2 × 2 × 5 × 7
Therefore, .
(ii) 156
156 = 2 × 78
156 = 2 × 2 × 39
156 = 2 × 2 × 3 × 13
Therefore, .
(iii) 3825
3825 = 5 × 765
3825 = 5 × 5 × 153
3825 = 5 × 5 × 3 × 51
3825 = 5 × 5 × 3 × 3 × 17
Therefore, .
(iv) 5005
5005 = 5 × 1001
5005 = 5 × 7 × 143
5005 = 5 × 7 × 11 × 13
Therefore, .
(v) 7429
7429 = 17 × 437
7429 = 17 × 19 × 23
Therefore, .
Question 2: Find the LCM and HCF of the following pairs of integers and verify that LCM × HCF = product of the two numbers.
(i) 26 and 91
(ii) 510 and 92
(iii) 336 and 54
Solution-
(i) 26 and 91
Prime factorisation of .
Prime factorisation of .
HCF is the product of the smallest power of each common prime factor.
HCF.
LCM is the product of the greatest power of each prime factor involved in the numbers.
LCM.
Verification:
Product of the two numbers .
Product of HCF and LCM .
Since LCM HCF product of the two numbers, the verification holds true.
(ii) 510 and 92
Prime factorisation of .
Prime factorisation of .
HCF is the product of the smallest power of each common prime factor in the numbers.
HCF.
LCM is the product of the greatest power of each prime factor, involved in the numbers.
LCM.
Verification:
Product of the two numbers .
Product of HCF and LCM .
Since LCM HCF product of the two numbers, the verification holds true.
(iii) 336 and 54
Prime factorisation of .
Prime factorisation of .
HCF is the product of the smallest power of each common prime factor in the numbers.
The common factors are 2 and 3. Smallest powers are and .
HCF.
LCM is the product of the greatest power of each prime factor, involved in the numbers.
Greatest powers are , , and .
LCM.
Verification:
Product of the two numbers .
Product of HCF and LCM .
Since LCM HCF product of the two numbers, the verification holds true.
Question 3: Find the LCM and HCF of the following integers by applying the prime factorisation method.
(i) 12, 15 and 21
(ii) 17, 23 and 29
(iii) 8, 9 and 25
Solution-
(i) 12, 15 and 21
Prime factorisation:
HCF is the product of the smallest power of each common prime factor.
The only common prime factor is 3.
HCF.
LCM is the product of the greatest power of each prime factor involved.
LCM.
(ii) 17, 23 and 29
Prime factorisation:
HCF is the product of the smallest power of each common prime factor. Since 17, 23, and 29 are all prime numbers, they share no common prime factors other than 1.
HCF.
LCM is the product of the greatest power of each prime factor involved.
LCM.
(iii) 8, 9 and 25
Prime factorisation:
HCF is the product of the smallest power of each common prime factor. Since they share no common prime factors, the HCF is 1.
HCF.
LCM is the product of the greatest power of each prime factor involved.
LCM.
Question 4: Given that HCF (306, 657) = 9, find LCM (306, 657).
Solution-
We know that for any two positive integers and :
HCF LCM.
Here, , , and HCF.
LCM
LCM
LCM
LCM.
Question 5: Check whether can end with the digit 0 for any natural number .
Solution-
If the number , for any natural number , were to end with the digit zero, then it would be divisible by 5.
If a number is divisible by 5, then the prime factorisation of that number must contain the prime 5.
The prime factorisation of :
.
The only primes in the factorisation of are 2 and 3. The uniqueness of the Fundamental Theorem of Arithmetic guarantees that there are no other primes in the factorisation of . Since the prime factorisation of does not contain the prime 5, it is not divisible by 5.
Therefore, there is no natural number for which ends with the digit zero.
Question 6: Explain why and are composite numbers.
Solution-
A composite number is any natural number that can be expressed (factorised) as a product of primes.
First Number:
We can take 13 as a common factor:
Since , we can write:
Since the number is expressed as a product of primes (13, 2, and 3), it is a composite number.
Second Number:
We can take 5 as a common factor:
Since 1009 is a prime number (this must be verified, similar to checking 3803 and 3607 in Example 8), the number is expressed as a product of primes (5 and 1009).
Since both given expressions can be factorized as a product of primes, they are composite numbers.
Question 7: There is a circular path around a sports field. Sonia takes 18 minutes to drive one round of the field, while Ravi takes 12 minutes for the same. Suppose they both start at the same point and at the same time, and go in the same direction. After how many minutes will they meet again at the starting point?
Solution-
They will meet again at the starting point when the time elapsed is a common multiple of both 18 minutes and 12 minutes. Since they start at the same time and go in the same direction, the moment they meet again for the first time will be the Least Common Multiple (LCM) of 18 and 12.
Find the prime factorisation of 18 and 12:
LCM is the product of the greatest power of each prime factor involved in the numbers.
LCM.
They will meet again at the starting point after 36 minutes.
EXERCISE 1.2
Question 1: Prove that is irrational.
Solution-
We use the method of proof by contradiction.
Assume, to the contrary, that is rational.
If is rational, we can find integers and () such that .
Suppose and have a common factor other than 1. We divide by this common factor and assume that and are coprime.
So, .
Squaring on both sides, we get .
This means that is divisible by 5.
By Theorem 1.2 (If divides , then divides , where is a prime), it follows that is also divisible by 5.
We can write for some integer .
Substituting into the equation :
.
This means that is divisible by 5, and by Theorem 1.2 (with ), it follows that is also divisible by 5.
Therefore, and have at least 5 as a common factor.
But this contradicts the fact that and are coprime (have no common factors other than 1).
This contradiction has arisen because of our incorrect assumption that is rational.
We conclude that is irrational.
Question 2: Prove that is irrational.
Solution-
We use the method of proof by contradiction.
Assume, to the contrary, that is rational.
That is, we can find coprime integers and () such that .
Rearranging the equation to isolate :
Since and are integers, and are also integers. Therefore, is a rational number.
This implies that is rational.
But this contradicts the fact that is irrational (as proven in Question 1).
This contradiction has arisen because of our incorrect assumption that is rational.
We conclude that is irrational.
Question 3: Prove that the following are irrationals:
(i)
(ii)
(iii)
Solution-
(i)
Assume, to the contrary, that is rational.
We can write , where and are coprime integers ().
Rearranging the equation gives .
Since and are integers, is rational.
This implies that is rational.
But this contradicts the known fact that is irrational.
This contradiction proves that is irrational.
(ii)
Assume, to the contrary, that is rational.
We can write , where and are coprime integers ().
Rearranging the equation to isolate :
Since , and are integers, is a rational number.
This implies that is rational.
But this contradicts the fact that is irrational.
We conclude that is irrational. (This follows the principle that the product and quotient of a non-zero rational and an irrational number is irrational).
(iii)
Assume, to the contrary, that is rational.
We can find coprime integers and () such that .
Rearranging the equation to isolate :
Since and are integers, is a rational number.
This implies that is rational.
But this contradicts the known fact that is irrational.
This contradiction proves that is irrational. (This follows the principle that the sum or difference of a rational and an irrational number is irrational).