Downloaded from www.studiestoday.

com

UNIT-1

NUMBER SYSTEMS

1*,$#2 2# !&# # &* " &!# # & & $# !% ! ( & , !3 ! -

1. If the H C F of 657 and 963 is expressible in the form of 657x + 963x - 15 find x.
(Ans:x=22)

Ans: Using Euclid’s Division Lemma

a= bq+r , o ≤ r < b

m
963=657×1+306
657=306×2+45

co
306=45×6+36

y.
45=36×1+9
36=9×4+0
∴ HCF (657, 963) = 9 da
now 9 = 657x + 963× (-15)
to
657x=9+963×15
=9+14445
es

657x=14454
x=14454/657
di
tu

x =22
.s
w

2. Express the GCD of 48 and 18 as a linear combination. (Ans: Not unique)

w
w

A=bq+r, where o ≤ r < b

48=18x2+12
18=12x1+6
12=6x2+0
∴ HCF (18,48) = 6
now 6= 18-12x1
6= 18-(48-18x2)
6= 18-48x1+18x2
6= 18x3-48x1
6= 18x3+48x(-1)
i.e. 6= 18x +48y

∴ x=3 , y=-1

Downloaded from www.studiestoday.com

 Downloaded from www.studiestoday.com

6= 18×3 +48×(-1)
=18×3 +48×(-1) + 18×48-18×48
=18(3+48)+48(-1-18)
=18×51+48×(-19)
6=18x+48y

∴ x = 51, y = -19

Hence, x and y are not unique.

3. Prove that one of every three consecutive integers is divisible by 3.

m
Ans:
n,n+1,n+2 be three consecutive positive integers

co
We know that n is of the form 3q, 3q +1, 3q + 2
So we have the following cases

y.
Case – I when n = 3q da
In the this case, n is divisible by 3 but n + 1 and n + 2 are not divisible by 3
to
es

Case - II When n = 3q + 1
Sub n = 2 = 3q +1 +2 = 3(q +1) is divisible by 3. but n and n+1 are not
di

divisible by 3
tu

Case – III When n = 3q +2

.s

Sub n = 2 = 3q +1 +2 = 3(q +1) is divisible by 3. but n and n+1 are not

divisible by 3
w
w

Hence one of n, n + 1 and n + 2 is divisible by 3

w

4. Find the largest possible positive integer that will divide 398, 436, and 542 leaving
remainder 7, 11, 15 respectively.
(Ans: 17)

Ans: The required number is the HCF of the numbers

Find the HCF of 391, 425 and 527 by Euclid’s algorithm

∴ HCF (425, 391) = 17

Now we have to find the HCF of 17 and 527

527 = 17

Downloaded from www.studiestoday.com

 Downloaded from www.studiestoday.com

∴ HCF (17,527) = 17
∴ HCF (391, 425 and 527) = 17

5. Find the least number that is divisible by all numbers between 1 and 10 (both
inclusive).

(Ans:2520)
Ans: The required number is the LCM of 1,2,3,4,5,6,7,8,9,10

∴ LCM = 2 × × × × × ×

6. Show that 571 is a prime number.

m
Ans: Let x=571 √x=√571

co
Now 571 lies between the perfect squares of (23)2 and (24)2
Prime numbers less than 24 are 2,3,5,7,11,13,17,19,23

y.
Since 571 is not divisible by any of the above numbers
571 is a prime number da
to
7. If d is the HCF of 30, 72, find the value of x & y satisfying d = 30x + 72y.
es

(Ans:5, -2 (Not unique)

di

Ans: Using Euclid’s algorithm, the HCF (30, 72)

tu

72 = 30 × 2 + 12
30 = 12 × 2 + 6
.s

12 = 6 × 2 + 0
w
w

HCF (30,72) = 6
6=30-12×2
w

6=30-(72-30×2)2
6=30-2×72+30×4
6=30×5+72×-2
∴ x = 5, y = -2

Also 6 = 30 × 5 + 72 (-2) + 30 × 72 – 30 × 72

Solve it, to get

x = 77, y = -32

Hence, x and y are not unique

Downloaded from www.studiestoday.com

 Downloaded from www.studiestoday.com

8. Show that the product of 3 consecutive positive integers is divisible by 6.

Ans: Proceed as in question sum no. 3

9. Show that for odd positive integer to be a perfect square, it should be of the form
8k +1.
Let a=2m+1
Ans: Squaring both sides we get

a2 = 4m (m +1) + 1

∴ product of two consecutive numbers is always even

m(m+1)=2k
a2=4(2k)+1

m
a2 = 8 k + 1

co
Hence proved

y.
10. Find the greatest number of 6 digits exactly divisible by 24, 15 and 36.
(Ans:999720) da
Ans: LCM of 24, 15, 36
to
×2×2×2×3×
es

LCM = 3 5 = 360
di

Now, the greatest six digit number is 999999

Divide 999999 by 360
tu

∴ Q = 2777 , R = 279
.s

∴ the required number = 999999 – 279 = 999720

w
w

a a − 2b
w

11. If a and b are positive integers. Show that √2 always lies between and
b a+b

a 2 − 2b 2 a a + 2b
Ans: We do not know whether or <
b( a + b ) b a+b
∴ to compare these two number,

a a + 2b
Let us comute −
b a+b
a 2 − 2b 2
=> on simplifying , we get
b( a + b )

Downloaded from www.studiestoday.com

 Downloaded from www.studiestoday.com

a a + 2b a a + 2b
∴ − > 0 or − <0
b a+b b a+b

a a + 2b
now − >0
b a+b

a 2 − 2b 2
> 0 solve it , we get , a > √2b
b( a + b )

Thus , when a > √2b and

a a + 2b
< ,
b a+b

m
a + 2b a
We have to prove that <√2<
a+b

co
b

Now a >√2 b 2a2+2b2>2b2+ a2+2b2

y.
On simplifying we get

a + 2b
da
√2>
to
a+b
Also a>√2
es

a
>√2
di

b
a + 2b
tu

Similarly we get √2, <

a+b
.s

a a + 2b
Hence <√2<
a+b
w

b
w
w

12. Prove that ( n − 1 + n + 1 ) is irrational, for every n∈N

Self Practice

10

Downloaded from www.studiestoday.com