Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

08 NUMBER SYSTEM/la[;k i¼fr

Number
la[;k

Real Numbers Imaginary Numbers

okLrfod la[;k dkYifud la[;k

Rational Number Irrational Numbers Complex Numbers

ifjes; la[;k vifjes; la[;k lfeJ la[;k

r
si
Integers Fractions (Decimals)
iw.kkZad fHkUu
(n'keyo)

an by
n
Positive Integers Zero Negative Integers
/ukRed iw.kkZad 'kwU; udkjkRediw.kkZad

ja
R s
a th

Non-Negative Non-Positive
xSjudkjkRed xSj/ukRed
ty a

Whole Numbers Natural Numbers

di M

iw.kZ
la[;k izkÑfrdla[;k

Prime Number Unity Composite Numbers

vHkkT;la[;k ,dkad HkkT;la[;k

A. Factor/xq.ku[kaM (ii) Total number of odd factors

N = ap×bq×cr×ds×........
dqy fo"ke xq.ku[kaMksa dh la[;k
Where, a, b, c, and d are prime number. (q+1) (r+1) (s+1)...... where a = 2
tgkaa, b, c, vkSjd vHkkT; la[;k gSaA Ex. 240 = 24×31×51
A

(i) Total number of factors of a number odd factors of 240 = (1+1) (1+1) = 2×2 = 4

fdlh la[;k ds dqy xq.ku[kaMksa dh l[a;k (iii) Total number of even factors

(p+1) (q+1) (r+1) (s+1)....... dqy le xa.ku[kaMksa dh la[;k

For example : Total number of factors of p (q+1) (r+1) (s+1)...... = Total factor–odd factors
mnkgj.k%
300 ds dqy xq.ku[kaMksa dh l[a;k Ex. 1200 = 24×31×52
300 = 2² × 31 ×5² = (2+1) (1+1) (2+1) Even factors = 4(1+1) (2+1) = 4×2×3 = 24
= 3×2×3 = 18 [or even factors = 5×2×3 – 2×3 = 24]

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 74

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

(iv) Sum of factors of a given number (vi) Sum and number of factors satisfying other con-
fdlh nh gqbZ la[;k ds xq.ku[kaMksa dk ;ksxiQy ditions
= (a0+a1+...+ap) (b0+b1+...+bq) (c0+c1+...+cr)..... ,sls xq.ku[kaMksa dh la[;k rFkk ;ksxiQYk tks nwljh n'kkvks
dks lrq"V djrs gSaA
p 1 q 1 r 1
a –1 b –1 c –1
 
a –1 b –1 c –1
Ex. 7056 = 24×32×72 (a) Sum of factors of a number which are divisible
Sum of factors of 7056 by (b1×c1)
= (2° + 21 + 2² + 2³ + 24) (3° + 31 + 3²) (7° + 71 + 72)
(b1 × c1) ls foHkkT; la[;k ds xq.ku[kMksa dk ;ksxiQy
5 3 3
2 –1 3 –1 7 –1
= 2 –1  3 –1  7 –1 = (a0+a1+.....+ap) (b1+b2+...bq) (c1+b2+...cr)
(b) Sum of factors of a number which are divisible
31 26 342 by (a2×b3).
=  
1 2 6
(v) Sum of even and odd factors of a number
(a2 × b3) ls foHkkT; la[;k ds xq.ku[kMksa dk ;ksxiQy
fdlh la[;k ds le vkSj fo"ke xq.ku[kaMksa dk ;ksxiQYk= (a2+a3+...+ab) (b3+b4+...+bq) (c1+c2+...+cr)

r
(a) Sum of even factors/le xq.ku[kaMksa dk ;ksxiQy So that every individual term of the expansion,

si
= (a1+a2+...+ap) (b0+b1+..bq) (c0+c1+...+cr) there is a minimum of a2×b3.

an by
 a q 1 – 1  b q 1 – 1 c r 1 – 1 (d) Sum of perfect square factors of a number
 – 1  
 a 1  b –1 c –1
fdlh la[;k ds iw.kZ oxZ xq.ku[kaMksa dk ;ksxiQy

n
a p 1 – a bq 1 – 1 cr 1 – 1
   = (a0+a2+a4+....) (b0+b2+....) (c0+c2+....)
a –1 b –1 c –1

ja
= Every power only
R s
Ex. Sum of even factors of 270 = ?
270 ds lexq.ku[kaMksa dk ;ksxiQy Ex. Find the sum and the number of factors of 2400
a th

1
270 = 2 × 3 × 5 3 1 such that the factors are divisible by 15.
Sum of even factors 2400 ds ,sls xq.ku[kaMksa dh la[;k rFkk ;ksxiQYk Kkr
= (21) (30 + 31 + 3² + 3³) (50 + 51)
dhft, tks 15 ls foHkkT; gksA
ty a

= 2 × 40 × 6 = 480
or 2400 = 25 × 52 × 31
di M

 211 – 1   331 – 1   51 1 – 1  Factors which are divisible by 15 should com-

=  – 1  3 – 1   5 – 1  pulsorily have 31 an 51 in it.
 2 –1
 Sum of factors divisible by 15
80 24
= 2   480 = (20 + 21 + 23 + 24 + 25) (31) × (51 × 52)
2 4
= 63 × 3 × 30
(b) Sum of odd factors/fo"ke xq.ku[kaMksa dk ;ksxiQy
= 5670
= a0 (b0+b1+...bq) (c0+c1+....+cr)
where a = 2 and consequently the number of factors which
b q 1
c –1 r 1 are divisible by 15
 
b –1 c –1 = 6 × 1 × 2 = 12
A

Ex. Sum of odd factors of 360 = ?

Ex. Find the number of factors of 1080 which are
360 ds fo"ke xq.ku[kaMkas dk ;ksxiQYk perfect squares.
360 = 2³ × 3² × 51
1080 ds ,sls xq.ku[kaMksa dh la[;k Kkr dhft, tks iw.kZ
Sum of odd factors
= 20 (30 + 31 + 32) (50 + 51) oxZ gkssA
= 1 × 13 × 6 = 78
1080 = 2³ × 3³ × 51
or
32 1 – 1 51 1 – 1 26 24 The number of perfect square factors of 1080
=    = 78 are the terms in expansion = 4
3 –1 5 –1 2 4

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 75

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

B. Remainder/'ks"kiQYk (ii) Remainder of Factor/xq.ku[kaMksa ds 'ks"kiQy

The remainder is the integer left over after di- A dividend is divided by a divisor and there is
viding one integer by another to produce an in- a remainder. If factor of divisor divides same
teger quotient dividend then assume dividend as the remain-

,d iw.kkZad dks fdlh nwljs iw.kkZad ls Hkkx nsus ij iw.kkZad

der.

fdlh HkkT; dks fdlh Hkktd }kjk Hkkx fn;k tkrk gS rks
HkkxiQy izkIr djus ds ckn 'ks"k cps iw.kkZad dks 'ks"kiQy
dgrs gSaA dqN 'ks"kiQy izkIr gksrk gSA ;fn Hkktd dk xq.ku[kaM mlh
HkkT; dks foHkkftr djs rks HkkT; dks 'ks"kiQy eku ysaA
Divisor Hkktd Dividend HkkT;Quotient HkkxiQy
××× Ex. On dividing a certain number by 72 we get 11
Remainder as remainder what will be the remainder.
'ks"kiQYk
fdlh fuf'pr la[;k dks 72 ls Hkkx nsus ij 'ks"kiQy
Concept of Negative Remainders/udkjRed

r
11 izkIr gksrk gS] 'ks"kiQy D;k gksxk ;fn&
'ks"kiQy dh vo/kj.kk

si
(i) If the same number is divided by 8
Remainder by definition are always non-nega-
mlh la[;k dks8 ls foHkkftr fd;k tk,

an by
tive but we use negative remainder in calcula-
tion for avoid long calculations. (ii) If double of the number is divided by 6

n
ifjHkk"kk ds vuqlkj 'ks"kiQy ges'kk xSj udkjkRed gksrk gSA
la[;k ds nksxqus 6dks
ls foHkkftr fd;k tk,

ja
ijUrq yEch x.kuk ls cpus ds fy, ge udkjkRed 'ks"kiQy
R s
(iii) If square of the number is divided by 9
dk iz;ksx djrs gSaA mlh la[;k ds oxZ dks9 ls foHkkftr fd;k tk,
a th

Ex. 29 % 9 = + 2 because 29 is 2 surplus

(iii) Successive Division/Øekxr foHkktu
29dks 9 ls Hkkx nsus ij 'ks"kiQYk
+ 2 cprk gSA
ty a

When a number N is divided successively by a

D;ksafd ;g27 ls nks vf/d gSA
and b, remainder obtained are c and d respec-
di M

(29 = 9 × 3 +2) tively. Which mean first we divide N by a and

= –7 because 29 is 7 deficient then the quotient obtained is divided by b.

vFkok]29 dks 9 ls Hkkx nsus ij 'ks"kiQy

–7 cprk tc fdlh la[;k N dks a rFkkb }kjk Øekxr :i ls
gSA D;kasfd36;gls 7 de gSA Hkkx fn;k tkrk gS rks 'ks"kiQy Øe'k%
c rFkkd izkIr
(29 = 9 × 4 – 7) gksrk gSA bldk vFkZ gksrk gS fd igys
N dks
gea ls
Special Case: Hkkx nsrs gS vkSj fiQj izkIr HkkxiQy
b ls foHkkftr
dks
(i) If two numbers are each divided by the same
djrs gSaA
divisor, the remainder are respectively 'r1' and
'r2'. If the sum of the two number be divided
A

by the same divisor, the remainder is 'r3'. Then

a N x
;fn nks la[;kvksa esa ls izR;sd dks leku HkkTkd ls Hkkx
×
fn;k tk, rks 'ks"kiQYk Øe'k% r1 rFkkr2 izkIr gksrs gSaA
c
;fn nksuksa la[;kvksa ds ;ksxiQy dks Hkh mlh Hkktd ls d x y
Hkkx fn;k tk, vkSj 'ks"kiQy
r3 izkIr gks rks] ×
Divisor/Hkktd= r1 + r2 – r3 d

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 76

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

Ex. A number on being divided by 3 and 4 succes-

sively leaves the remainder 1 and 2 respectively.  a n – bn 
(d) Remainder   = 0 for all value of n
Find the remainder when the same number is  (a – b) 
divided by 10.
 836 – 236 
fdlh la[;k dks 3 rFkk4 }kjk Øekxr :i ls Hkkx fn, Ex. Re  0
 6 
tkus ij 'ks"kiQYk Øe'k%1 rFkk2 izkIr gksrs gSaA mlh
la[;k dks10 Hkkx nsus ij izkIr 'ks"kiQy Kkr dhft,A  a n – bn 
(e) Remainder   = 0 when n is even.
Reverse the position of remainder and quotient  (a  b) 
and start question backward.
 724 – 424 
'ks"kiQy RkFkk HkkxiQy dh fLFkfr dks myVk Ex.
dj nssa
Re vkSj
 =0
 11 
iz'u dks ihNs ls gy djuk 'kq: djsaA
(a  1)n
(f) Remainder = 1 for all value of n
Quotient Remainder a
3 1 74 25 74  74  .... 1  1  1  ....

r
Ex.   1
4 2 73 73 73

si
0 For smallest (g) Remainder [(a – 1)n/a] = 1 when n is even.
number = (a – 1) or –1 when n is odd

an by
Ex. 34282 % 35 = (–1)282 % 35 = 1 % 35 = 1
3 7 1 34281 % 35 = (–1)281 % 35 = – 1 % 35 = 35 –1 = 34
4 2 2 3×2+1 C. Rules of divisibility/foHkkT;rk ds fu;e

n
0 4×0+2 (i) Divisibility by 2: A number is divisible by 2 if

ja
the last digit of the number is 0, 2, 4, 6, or 8.
R s
3 19 1 2 ls foHkkT;rk% dksbZ2la[;k
ls foHkkT; gksxh ;fn la[;k
4 6 2 3×6+1 dk bdkbZ vad0, 2, 4, 6 vFkok8 gksA
a th

1 4×1+2
(ii) Divisibility by 3: A number is divisible by 3 if the
For second
smallest number sum of the digits of the number is divisible by 3.
3 ls foHkkT;rk% dksbZ3la[;k
;s foHkkT; gksxh ;fn la[;k
Some important rules for remainder/'ks"kiQy ds
ty a

ds vadksa dk ;ksx3 ls foHkkT; gksA

dqN egRoiw.kZ fu;e (iii) Divisibility by 4: A number is divisible by 4 if the
di M

(a n  bn ) last two digits of the number are divisible by 4.

(a) Remainder = 0 when n is odd
(a  b) 4 ls foHkkT;rk% dksbZ4la[;k
foHkkT; gksxh ;fn la[;k ds
vfUre nks vad4 ls foHkkT; gksA
 8371  5371  (iv) Divisibility by 5: A number is divisible by 5 if
Ex. Re    0 [Here13  8  5]
 13  the last digit of the number is 0 or 5.
5 ls foHkkT;rk% dksbZ5la[;k
ls foHkkT; gksxh ;fn la[;k
(a n  b n  c n )
(b) Remainder
(a  b  c)
= 0 when n is odd dk bdkbZ vad0 vFkok5 gksA
(v) Divisibility by 6: A number is divisible by 6 if
 361  261  461  the number is divisible by both 2 and 3.
Ex. Re  0 6 ls foHkkT;rk% dksbZ la[;k 6 ls foHkkT; gksxh ;fn
 9 
la[;k2 rFkk3 nksuksa ls foHkkT; gksA
A

 a n  bn  cn  .....  (vi) Divisibility by 7: Multiply last digit by 2 and

(c) Remainder =   = 0 if (a + b + c +...) subtract from remaining number. Repeat this
 (a  b  c) 
process until number become less then check
are in Arithmetic progression and n is odd divisibility of 7.
 1673  1773  1873  1973  7 ls foHkkT;rk% la[;k ds vfUre vad 2dksls xq.kk djsa
Ex. Re =  
 9  vkSj 'ks"k la[;k ls ?kVk nsaA ;g izfØ;k rc rd nksgjk,a tc
 n = 73 (odd), 16+17+18+19 = 70 and 16, 17, rd fd la[;k NksVh uk gks tk, vkSj fiQj lkr dh
18 and 19 are in A.P.
foHkkT;rk tkapsaA

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 77

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

(vii) Divisibility by 8: A number is divisible by 8 if the Ex. Find the units digit in each of the following
last 3 digits of the number are divisible by 8. cases.
foHkkT; gksxh ;fn la[;k ds fuEufyf[kr izR;sd n'kk esa bdkbZ vad Kkr dhft,A
8 ls foHkkT;rk% dksbZ8la[;k
vfUre 3 vad 8 ls foHkkT; gksA (i) (187)282 × (529)321 × (343)236
(ii) (789)315 + (232)644 + (528)253
(viii) Divisibility by 9: A number is divisible by 9 if
(iii) (982)481 – (219)241
the sum of the digits is divisible by 9.
(i) Divide last 2 digits of power by 4 and put re-
9 ls foHkkT;rk% dksbZ la[;k 9 ls foHkkT; gksxh ;fn la[;kmainder as a power of unit place digit.
ds vadksa dks ;ksx
9 ls foHkkT; ?kkr ds vafre2 vadksa dks
4 ls foHkkftr djds izkIr
(viv) Divisibility by 11: If the difference between the 'ks"kiQy dks bdkbZ vad dh la[;k dh ?kkr ds :i esa j[krs
sum of the digits at odd place and sum of the
digits at even places is equal to zero or multiple gSaA
of 11. 72 × 91 × 34 9 × 9 × 1  1
(ii) 93 + 24 + 81  9 + 6 + 8  3
11 ls foHkkT;rk% ;fn la[;k ds fo"ke LFkkuksa ds vadksa ds
(iii) 21 – 91  12 – 9  3
;ksx dk la[;k ds le LFkkuksa ds vadksa ds ;ksx ls varj 'kwU;
[If first number is less than add 10 in it]

r
;k 11 dk xq.kt gks rks la[;k
11 ls foHkkT; gksxhA [;fn izFke la[;k NksVh gks rks10 blesa
tksM+] nsa

si
(ix) Divisibility by 12: A number is divisible by 12 if
the number is divisible by both 3 and 4.
E. LCM and HCF/y-l-i- vkSj e-l-i
12

an by
ls foHkkT;rk% dksbZ12 la[;k
ls foHkkT; gksxh ;fn
la[;k 3 rFkk4 nksuksa ls foHkkT; gksA
Product of two numbers/nks la[;kvkssa dk xq.kuiQy
LCM × HCF
=

n
 Product of "n" numbers/"n" la[;kvksa dk xq.kuiQy
D. Unit Digit/bdkbZ vad

ja
= HCF(n–1) × LCM
R s
The unit's digit of an expression can be calcu- (1) L.C.M. of Fractions/fHkUuksa dk y-l-i-
lated by getting the remainder while the expres-
a th

sion is divided by 4. L.C.M. of Numbnerators

=
fdlh O;tad ds bdkbZ vad dh x.kuk mldks pkj ls Hkkx H.C.F. of Denominators

nsus ds ckn izkIr 'ks"kiQy ls djrs gSaA (2) H.C.F. of Fractions/fHkUuksa dk e-l-i-
ty a

Ex. What will be the unit's digit of (382)575?

H.C.F. of Numberators
(382)575dk bdkbZ vad D;k gksxk\ =
di M

L.C.M. of Denominators
Step/pj.k 1:
Divide last 2 digits of power by 4 and find out (3) H.C.F. and L.C.M. of polynomials.
remainder. cgqinksa dk e-l-i- rFkk y-l-i-
?kkr ds vfUre2 vdksa dks
4 ls Hkkx nsdj 'ks"kiQYk (a)
izkIrH.C.F. of two or more polynomials is the
djrs gSaA "Common factor of highest degree".

4 75 18
nks ;k nks ls vf/d cgqinksa dk e-l-i- ¶vf/dre ?kkr
4 dk mHk;fu"B xq.ku[kaM¸
35 (b) L.C.M. of two or more polynomials is the
32
3 "Common multiple of least degree".
nks ;k nks ls vf/d cgqinksa dk y-l-i- ¶U;wure ?kkr dk
A

Step/pj.k 2:
Put remainder as a power of unit place number mHk;fu"B xq.kt¸
and find out answer.
1st polynomial × 2nd polynomial
'ks"kiQy dks bdkbZ vad dh la[;k ds ?kkr ds :i esa j[kdj
(c) L.C.M. =
H.C.F.
mÙkj izkIr djrs gSaA
23 = 8 1st polynomial × 2nd polynomial
(d) H.C.F. =
Note: In Step 1, if remainder is 0 is then put L.C.M.
power equal to 4.
pj.k 1 esa ;fn 'ks"kiQy
0 gks rks ?kkr 4
dks
j[krs gSaA (e) L.C.M. × H.C.F. = Product of two polynomial

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 78

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

LCM : y-l-i- (3) Sum of digits/vadksa dk ;ksxiQYk

Ex. Find out sum of all digits from 1 to 100.
1 ls 100 rd dh la[;k esa iz;qDr lHkh vadksa dk ;ksxiQYk
Kkr dhft,A
Find the smallest no. Which when divided Unit place digit/bdkbZ vad
 10 (1 + 2 +.........+9)
by x, y, z leaves remainder “r” in each case.
og U;wure la[;k Kkr dhft, tksx,y,z ls iw.kZr% Hkkx = 450
nsus ij izR;sd n'kk esar'ks"k izkIr gksA Second place digit/ ngkbZ vad 10 (1 + 2
+............+ 9) = 450
Third place digit/lSdM+k
1
Total = 450 + 450 + 1 = 901
 Least number to be added or subtracted to given
number so it becomes divisible of a divisor.
HCF : e-l-i-
fdlh nh gqbZ la[;k eas lcls NksVh la[;k bl izdkj
tksM+uk@?kVkuk fd ;g fdlh Hkktd ls foHkkftr gks tk,A

r
Ex. What is least number to be added to 42072 to

si
get a number which is divisible by 93?
42072 eas og dkSu&lh U;wure la[;k tksM+h tk, fd izkIr

an by
Find the largest no. Which when
divided by x, y, z leaves remainder “r”
in each case. la[;k 93 ls foHkkftr gks tk,\
og U;wure la[;k Kkr dhft, tksx,y,z ls

n
Hkkx nsus ij izR;sd n'kk esa 'ks"kiQy
r izkIr gksrk 93 42072 452
gksA 372

ja
R s
487
465
a th

222
186
36
So least number to be added is/blfy,] lcls NksVh
ty a

F. Counting of Numbers/la[;kvksa dh fxurh tksM+h tk ldus okyh la[;k

93 – 36 = 57
di M

(1) Counting a Digit/vadksa dh fxurh  Prime Number/vHkkT; la[;k

Ex. How many times 5 will come from 350 to 600. Except 1 each natural number which is divisible
350 ls 600 ds chp 5 fdruh ckj vk,xkA by only 1 and itself is called a prime number.
Sol. 1 dks NksM+dj izR;sd izkÑfrd la[;k tks
1 fliQZ
rFkk [kqn
I Place II Place III Place
350 – 400 5 10 × ls gh foHkkT; gks] vHkkT; la[;k dgykrh gSA
400 – 500 10 10 1 To check whether a number is prime number or
500 – 600 10 10 99 not, first take the square root of the number.
(500 alread count)
Ans.155 Round of the square root to the immediately
(2) Digits required to write counting. lower integer. Then check divisibility of number
fxurh dks fy[kus ds fy, vko';d vadA by all prime below it. If number is not divisible
A

Ex. How many digits required to write counting from by any prime number then number is prime
1 to 400? number.
1 ls 400 rd dh fxurh dks fy[kus ds fy, vko';d dksbZ la[;k vHkkT; gS ;k ugha] ;g Kkr djus ds fy,]
vadksa dh la[;k fdruh gS\ lcls igys la[;k dk oxZ ewYk ysa] oxZ ewy dks mlls NksVs
Single digits 1 to 9  9 number × 1 digit per
number = 9 iw.kkZad ds :i esa fy[k ysaA mlds ckn la[;k dh foHkkT;rk
Double digits 10 to 99  90 number × 2 digits
per number = 180
dh tkap mlls NksVh lHkh vHkkT; la[;kvksa }kjk djsaA ;fn
Three digits 100 to 400  301 number × 3 fdlh Hkh vHkkT; la[;k ls foHkkT; ugha gksrh rks ;g
digits per number = 903
Ans: 9+180+903 = 1092 Digits
vHkkT; la[;k gSA

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 79

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

Ex. 137 is prime number or not? dh rqyuk

 Comparison of Fraction./fHkUuksa
137 vHkkT; la[;k gS ;k ugha\ It is advisable to compare two fraction by cross
multiplication.
137  11  prime number less than or equal
to 11 are 2, 3, 5, 7 and 11, 137 is not divisible
dh rqyuk frjNs xq.ku[kaM fof/ }kjk djus dh
fHkUuksa
by any of there. Hence it is prime numbers. lykg yh tkrh gSA
Ex. The greatest value among the fractions.
11 ls NksVh ;k cjkcj vHkkT; la[;k,a
2, 3, 5, 7 rFkk11
fuEufyf[kr esa ls lcls cM+h fHkUUk dkSu&lh gSA
ls fdlh ds Hkh }kjk foHkkT; ugha gS blfy,
gS]137 bueas
2 1 5 3
;g ,d vHkkT; la[;k gSA , , , is :
7 3 6 4
Ex. What is average of prime number from 80 to
100? 2 1
6 < 7
7 3
80 ls 100 rd dh vHkkT; la[;kvksa dk vkSlr D;k gS\ 1 5
6 < 15
100 = 10  Prime number less than 10 are 2, 3 6
3, 5, 7 Hence, even number and ending with 5 5 3

r
20 > 18,
will not prime numbers so only check divisibility 6 4

si
of 3 and 7.
5
So is greatest fraction.
ls de dh vHkkT; la[;k,a 2, 3, 5, 7 gSa
] bl izdkj

an by
10 6
le la[;k vkSj 5 bdkbZ vad okyh la[;k,a vHkkT; la[;k,a b
 Special case of a numbers

n
3 vkSj7 dh foHkkT;rk tkpsaA
ugha gksxhaA blfy, fliQZ c
b
izdkj dh la[;kvksa ij vk/kfjr fo'ks"k fLFkfr

ja
Prime number are 83, 89 and 97. a
R s
c
vHkkT; la[;k,a83, 89, 97 gSa
A (a) If denominator of a number same as multiplier
a th

83 + 89 + 97 269 ;fn fdlh la[;k dk gj mlds xq.kt ds leku gks rks

Ans: = = 89.67
3 3 994
Ex. 999 × 999
 Some points about prime numbers. 999
ty a

Same
vHkkT; la[;k,a ls lEcfU/r dqN egRowi.kZ fcUnqA Add 5 in 994 so it becomes 999
994 esa5 tksM+us ls 999
;g gks tkrh gS
di M

(i) Prime number between 1 to 100 are

(994 + 5)
1 ls 100 ds chp dh vHkkT; la[;k,a 999
999
× 999

(1 to 50  15, 50 to 100  10) = (999 + 1) × 999

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, = 999000
Now substrate 5
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97
= 999000 – 5 = 998995
(ii) If a and b are any two odd primes then a2 + b2
(b) If difference between numerated and denomi-
and a2 – b2 is composite numbers.
nator is 1.
;fn a rFkkb nks
fo"ke vHkkT; la[;k,a gSa + b2 rFkk
a2rks ;fn va'k vkSj gj ds chp dk varj1 gks rks
HkkT
; la[;k,a gksxhaA
A

a2 – b2 1 791
Ex. + 999 × 99
Co-Prime Numbers/lg&vHkkT; la[;k,a 8 792
791 1
Two natural numbers are called co-prime (rela- Here 792 – 791 = 1 so we can write =1 –
792 792
tively prime) number if they have no common
factor other than 1. 1  1 
= +  999 +1 –  × 99
8  792 
nks izkÑfrd la[;k,a lgvHkkT; ;k lkis{k vHkkT; dgykrh gS
;fn 1 d s flok, muds dksbZ vkSj mHk;fu"B xq.ku[kaM u=gksA
1
+ 99000 –
99
= 99000
8 792
Ex. (3,8), (9,10),(12,17)

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 80

Join Telegram- Maths by Aditya Ranjan NUMBER OF SYSTEM

(c) Series Type/Js.khizdkj Ex. 0.535353............

53
1 2 4 =
Ex. 999 + 999 + ........... + 999 99
5 5 5
Ex. 0.28383............  = 0.283
1+ 2 + 3 + 4 Let x = 0.2838383............
999 × 4 + 10 x = 2.838383................ ............(1)
5
1000 x = 283.838383......... ............(2)
(4 × 5) / 2 Subtract (1) from (2)
= (400 – 4) + 990 x = 281
5
281
= 3996 + 2 = 3998 x=
990
1 2 10
Ex. 99 + 99 + ......... + 99 Ex. 0.5 73
11 11 11
573 – 5 568
= =
10 990 990
= 99 ×10 + = 995
2

r
Ex. 0.38 7
 Bar Type Questions/ckj okys iz'u 387 – 38

si
=
Ex. 0.7777.........  = 0. 7 900

an by
Let x = 0.777............ 349
10 x = 7.777............ =
900

n
Subtract (1) from (2)
Ex. 0.00 3
7

ja
9x = 7  x = 3 1
R s
9 = = .
900 300
a th
ty a
di M
A

Aditya Ranjan (Excise Inspector) Selected gSSelection fnyk,axs 81