Solution

Class 10 - Mathematics

maths

Section A

1. (b)

their product

Explanation:

The LCM of two consecutive numbers is their product always. ( e.g the LCM of 24,25

is equal to 24 25 = 600)

2. (d)

0, 1, 2, 3, 4, 5

Explanation:

For the relation x = qy + r,

So, here lies between

Hence​​, r = 0, 1, 2, 3, 4, 5.

3. (d)

2q + 1

Explanation:

Let be any positive integer and b = 2

Then by applying Euclid’s Division Lemma,

we have, a = 2q +r,

where = 0 or 1 a = 2q or 2q + 1 .

Therefore, it is clear that a = 2q i.e., a is an even integer.

Also, 2q and are two 2q + 1 consecutive integers, therefore, ​​2q + 1​ is an odd integer.

4. (d)

120

Explanation:

1 / 12
 Least positive integer divisible by 20 and 24 is

LCM of (20, 24).

LCM (20, 24) = = 120

Thus 120 is divisible by 20 and 24.

5. (a)

Explanation:

Euclid’s Division Lemma states that for given positive integer a and b,

there exist unique integers q and r satisfying a = bq + r;

6. (d)

2q

Explanation:

Let a be any positive integer and b=2

Then by applying Euclid’s Division Lemma, we have,

a = 2q + r where r = 0 or 1

Therefore, a = 2q or ​​2q + 1

Thus, it is clear that ​​a = 2q

i.e., ​​a is an even integer in the form of 2q

7. (b)

Explanation:

Let n be a positive integer,

then three consecutive positive integers are =

Here, the first term is divisible by 6 and the second term is also divisible by 6

Because it contains a factor 3 and one of the two consecutive integers or

2 / 12
 is even and thus is divisible by 2

Therefore, the sum of multiple of 6 is also a multiple of 6.

8. (d)

integer

Explanation:

Euclid’s Division Lemma states that

for given positive integer and , there exist unique integers and

satisfying

let b=6 then possible values of r will be 0,1,2,3,4,5

when b =6 , r = 0 then a = 6q +0

r = 1 a = 6q +1

r = 2 a = 6q +2

r = 3 a = 6q + 3

r = 4 a = 6q +4

r = 5 a = 6q + 5

but 6q , 6q + 2, 6q + 4 cannot be because they are all positive even integers while a

is odd integer

thus we can say that a can be 6q + 1 or 6q + 3 or 6q + 5

Hence, general form is bq + 1.

9. (a)

an odd integer

Explanation:

Since m2 is off for some non-negative integer k,

we have

Here, 2 divides left-hand side,

3 / 12
 it must be divide one of the factors on the right-hand side.

Suppose 2 divides (m - 1),

then (m - 1) is even,

i.e., m is odd.

10. (d)

7119

Explanation:

LCM HCF = Product of two numbers

56952 113 = 904 second number

= second number

Therefore, second number = 7119

11. 336 and 54

336= 2 × 2 × 2 × 2 × 3 × 7 = 2 4 × 3 × 7

54 = 2 × 3 × 3 × 3 = 2 × 3 3

HCF = 2 × 3 = 6

LCM = 2 4 × 3 3 × 7 = 3024

Product of two numbers 336 and 54 = 336 × 54 = 18144

HCF × LCM = 6 × 3024 = 18144

Hence, product of two numbers = HCF × LCM`

12. Let n = 4q + 1 (an odd integer)

= 8m, which is divisible by 8.

13. If a and b are odd numbers then it should be in 2q+1 or 2q+3 form where q is a

positive integer.

Let a = 2q + 3 , b = 2q + 1 and a > b

Now,

4 / 12
 = 2q + 2

=2(q+1) = an even number..........(1)

Now

= 1 = an odd number..........(2)

Hence From (1) and (2) and are even and odd numbers respectively

14. HCF of two or more positive integers is the largest positive integer that divides all the

numbers exactly.

Now by applying Euclid’s Division lemma on 70 and 30

70 = 30 2 + 10.

Since remainder ≠ 0, apply division lemma on divisor 30 and remainder 10

30 = 10 3 + 0.

Therefore, H.C.F. of 70 and 30 = 10.

15. HCF of two or more numbers is the biggest common factor which divides all the said

numbers exactly.

Now by applying Euclid’s Division lemma on 240 and 6552 we get

6552 = 240 27 + 72.

Since remainder ≠ 0, apply division lemma on divisor 240 and remainder 72

240 = 72 3 + 24.

Since remainder ≠ 0, apply division lemma on divisor 72 and remainder 24

72 = 24 3 + 0.

Here we get the remainder =0

Hence, HCF of 6552 and 240 is 24.

16. Since .

Hence, it is a composite number.

17. The said number when divides 2011 and 2623 the remainders are 9 and 5

It means that

2011 - 9 = 2002 and 2623 - 5 = 2618 are completely divisible by the number.

Therefore, the said number = HCF.(2002,2618)

By applying Euclid’s division lemma

2618 = 2002 1 + 616

5 / 12
 2002 = 616 3 + 154

616 = 154 4+ 0.

Therefore, HCF (2002,2618)=154

Hence, the number =154

18. 8, 9 and 25

8 = 2 × 2 × 2 = 23

9 = 3 × 3 = 32

25 = 5 × 5 = 52

HCF = 1

LCM = 23 × 32 × 52 = 1800

19.

So, 1152 = 2 2 2 2 2 2 2 3 3 = ​​27 32

20. The Highest Common Factor H C F of two or more numbers is the highest number that

divides the numbers exactly.

By applying Euclid’s division lemma for 190 and 100

6 / 12
 190 = 100 1 + 90.

Since remainder ≠ 0, apply division lemma on divisor 100 and remainder 90

100 = 90 1 + 10.

Since remainder ≠ 0, apply division lemma on divisor 90 and remainder 10

90 = 10 9 + 0.

Here remainder is zero

Hence HCF (190,100)=10

21. On applying division lemma on 1288 and 575 we get

1288 = 575 2+ 138........(1)

Since remainder ≠ 0, apply division lemma on divisor 575 and remainder 138

575 = 138 4 + 23..........(2)

Since remainder ≠ 0, apply division lemma on divisor 138 and remainder 23

138 = 23 6 + 0.

Hence HCF(1288,575) = 23

Now let 1288 = H and 575 = K

Then equation (1) and (2) can be written as:

H = 2k+138

or 138 = H-2K ....................(3)

and K = 138 4 + 23

or 23 = K -138 4

Substituting the value of 138 from (3) we get

23=K-4 (H-2K)

=K-4H+8K

=9K-4H

Now substituting the values of H and K we get

23=9 575 - 4 1288

22. Let n-1 and n be consecutive positive integers,Let P be their product

Then

We know that any positive integers is of the form 2q or 2q + 1, where q is a positive

integer

Case I: When n = 2q, then

P=n2 - n = (2q)2 - 2q = 4q2 - 2q = 2q(2q - 1)-----(2)

7 / 12
 Case II: When n = 2q + 1, then

P=n2 - n = (2q + 1)2 - (2q + 1)

= 4q2 + 4q + 1 - 2q - 1

= 4q2 + 2q

P = 2q(2q + 1)..........(3)

From (2) and (3) we conclude that

The product of n-1 and n is divisible by 2

23.

So, Prime factorization of 1440 = 2 2 2 2 2 3 3 5 = 25 32 5

24. 510 and 92

510= 2 × 3 × 5× 17

92 = 2 × 2 × 23

HCF = 2

LCM = 2 × 2 × 3 × 5 × 17 × 23 = 23460

Product of two numbers 510 and 92 = 510 × 92 = 46920

8 / 12
 HCF × LCM = 2 × 23460 = 46920

Hence, product of two numbers = HCF × LCM

25. First subtracting the remainders

122 - 5 = 117

150 - 7 = 143

115 - 11 = 104

Now prime factors of 117,143 and 104 are

117=32 13

143= 11 13

104= 23 13

The HCF of 104, 117 and 143 is 13

The largest number which divides 122, 150 and 115 leaving 5, 7 and 11 respectively as

remainders is 13

26. According to the question,we have to prove that a positive integer n is prime number,

if no prime p less than or equal to divides n.

Let n be a positive integer such that no prime less than or equal to divides n.

Then, we have to prove that n is prime. Suppose n is not a prime integer. Then, we

may write n = ab where 1 < a b

Let p be a prime factor of a. Then, and p|a

a prime less than divides n.

This contradicts our assumption that no prime less than divides n.

So, our assumption is is wrong. Hence, n is a prime.

27. As we know that, LCM HCF = Product of two numbers

Required L.C.M =

28. HCF of two or more positive integers is the largest positive integer that divides all the

numbers exactly.

We can find the H.C.F by applying division lemma on 18 and 24

24 = 18 1 + 6.

Since remainder ≠ 0, applying division lemma on divisor 18 and remainder 6

9 / 12
 18 = 6 3 + 0.

Therefore, H.C.F. of 18 and 24 is 6.

29.

30. The Given numbers are 136,170 and 255

Applying Euclid's division lemma to 136 and 170, we get

170 = 136 1 + 34

Since the remainder, 34 0.

So we apply the division lemma to divisor 136 and remainder 34

136 = 34 4 + 0

So HCF of 136 and 170 is 34

Now we apply Euclid's division lemma to 255 and 34

255 = 34 7 + 17

Since the remainder, 17 0.

So we apply the division lemma to divisor 34 and remainder 17,

34 = 17 2 + 0

therefore, HCF of 255 and 34 is 17

Hence the HCF of 136,170 and 255 is 17

10 / 12
31.

So, 1296 = 2 2 2 2 3 3 3 3 = 24 34

Hence the prime factors of 1296 are 2, 2, 2, 2, 3, 3, 3, 3.

32. HCF of two or more positive integers is the largest positive integer that divides all the

numbers exactly.

The given numbers are 32 and 54

By applying division lemma 54 = 32 1 + 22

Since remainder 0, apply division lemma on 32 and remainder 22

32 = 22 1 + 10

Since remainder ≠ 0, apply division lemma on 22 and remainder 10

22 = 10 2 + 2

Since remainder ≠ 0, apply division lemma on 10 and 2

11 / 12
 10 = 2 5 + 0

Therefore, H.C.F. of 32 and 54 is 2.

33. Let p(x) = 2x2 – x – 1

= 2x2 – 2x + x – 1 = (2x + 1) (x – 1)

and

The highest degree common divisor of p(x) and q(x) is (2x+1)

The HCF of p(x) and q(x) is (2x + 1)

34. HCF of two or more numbers is the greatest common factor which can divide all the

numbers exactly.

On applying Euclid's division lemma on 120 and 105 we get

120 = 105 1 + 15.

Since remainder ≠ 0, apply division lemma on divisor 105 and remainder 15

105 = 15 7 + 0.

Therefore, H.C.F. of 105 and 120 = 15.

35. 510 = 2 3 5 17

92 = 2 2 23

HCF of 510 and 92 = 2

LCM of 510 and 92 = 2 2 3 5 17 23 = 23460

Product of both the numbers = 510 92 = 46920

Product of HCF and LCM = 2 23460 =46920

Hence, product of two numbers = product of HCF LCM

12 / 12