Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
252 views19 pages

@udaan - Ind EduMantra Junoon Real Numbers PDF

Uploaded by

Rahul Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
252 views19 pages

@udaan - Ind EduMantra Junoon Real Numbers PDF

Uploaded by

Rahul Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

Downloaded from Tabahi Tenthies

Join Now. Click Here!

Visit the Official Channel – Click Here


Try Our Study Material Bot – Click Here
Join our Database Channel – Click Here

Disclaimer:
We don't own any material that is shared here. We have
just forwarded the materials that are already available in
Telegram or on Internet! If you are the rightful owner of
any contents posted here, and object to them being
displayed or if you are one of representativities of
copyrights department and you don’t like your Content
to be here, Please Contact Us at
@Contact_TabahiTenthies_Bot
We will remove it in 24-48 hour!
Real
Numbers
Real numbers
Real numbers -

All national & irrational numbers are real numbers .

Real numbers

Rational Irrational
Non
Plq 9-+0 terminating
-

Non
recurring
-

Terminating &
recurring numbers
leg to 1010010001
-
. . . . . .
. . .

3-
leg l 72 1. 7.9
- .

. . . . . .

, , ,

Integers
Whole numbers
-
. . . . .
,
-2

0
,
-1 ,
0
,
1 ,
2
,
. . . . .

,
I
,
2 ,
3 4, .
- - . . - . .

Natural numbers 1 2,3 -

, ,
4
,
5
,
. . . . . . . .

Even numbers Divisible -

by 2 .

leg -

2,4 ,
6,8 ,
. . . . . . .

Not divis
numbers
Odd
by 2 leg 1 3 5,7 - ble .
-

, , ,
. . . . . -

Prime numbers Divisible 1 &


itself leg 2,3 5,7 -

by .
-

, ,
. . . . .

Composite numbers Flare two or more factors are not -


.

They prime
-
.

leg 4 6 8 9,
-
- - . . . .

, , ,

Two numbers which does not have


Co
prime
-
numbers -
common

factors other than 1 .

leg -
2 & 3
,
3 &5 .

Algorithm -

ed series of defined steps


well which
gives a
procedure for
solving a
type of problem .

Lemma -

ed lemma is statement another


proven
used
for proving
statement .

Exercise -
1.1 .

Theorem 1.1 -

Euclid 's division lemma

Given positive integers a & b


,
there escist unique integers q&r ,

satisfying a =

bq + u ,
0sec b
dividend
#
a-
b- divisor b

g- quotient
u-
remainder n .

a. =
bqtee

Type 1-

Q Euclid 's
Using division
algorithm find
,
the HCF
of 2408228 .

A 240 > 228

Euclid 's division lemma


By a-
bq tie ,
0£ rats

240 =
228×1 -112

228 =
12×19+0

i. HCF ( 240,228) =
12

:
Use Euclid's division algorithm to find HFC of 65 & 175.

HCF(65, 175) = 5

Find the HCF of 180, 252 and 324 by Euclid's division algorithm.
e

HCF (324, 252, 180) = 36

Q Find the HCF of 1620, 1725 & 255 by Euclid's division algorithm.

HFC (1620, 1725 and 255)= 15

:
Two tankers contain 850 litres and 680 litres of petrol. Find the maximum capacity
of a container which can measure the petrol of each tanker in exact number of
times.
HCF (850, 680) = 170

144 cartons of Coke cans and 90 cartons of Pepsi cans are to be stacked in a canteen.
If each stack is of the same height & if it contain cartons of the same drink, what
would be the greatest number of cartons each stack would have?

HCF (144, 90) = 18


Type 2 -

Q show that the


square of any positive integer is either
of the
form
4g or
4g -11
for some
integer q .

A Euclid 's division lemma


By a bmtr
= 0Sr< b
.

b. 4
If =

a = 4min ,
0 Irc 4

i. Possible remainder can be 0, 1,2 or 3 .

i. a can be 4m ,
4m -11 ,
4m -12 or 4m -13

Case I
If a =
4m
-

i. at = (4mJ= 16mF
=
414mi) =

4g [ 4mi -

q ,
q is some
integer] a

case II
If a 4m -11
-
=



.
a' = Ctm -11J =
(4mY + 214m) (1) + it
=
16m2 -18m + I
=
4 ( ↳ m2 -12m) -1 I

4g -11 [ 4mi -12m -_q where is


integer]
=
some
, q

Case III If a 4m -12


-
=

Cem -125 limp-1


2
i. at = = 214m) (2) + (2)
=
16Mt + 16m -14
=
4 ( 4Mt -14m -11 )
=
4
q [ 4mL -14m -11--9 ,
where
q
is some
integer]
Case II
If a = 4m -13
-

i. at =
@ m -135--14 MY -12 (4m) (3) + (3)
2

= 16 m2 -1 24m + 9
=
16 m2 + 24m -1 8 + I
=
4 (↳ m2 -16m + 2) + I
=

4g -11 [ 4mi -16m -12 -_q ,


where
q
is some
integer]
From I , II & III
i. case
,
the
square of any positive integer is
where
either of the form 4g or
4g -11 , q is some
integer .
:
Prove that the square of any positive integer is of the form 5q, 5q + 1, 5q + 4 for some
integer q.

Show that the square of an odd positive integer is of the form 8q + 1, for some
integer q.

:
Prove that the square of any positive, integer is of the form 3m or, 3m + 1 but not of
the form 3m + 2.

Show that the square of an odd positive integer is of the form 8m+1, for some whole
number m.

Type 3-
Q Prove that ri is divisible
for every integer
-
n
by 2 n .

A
By Euclid 's division
n b 0 Sncb
lemma

qtr
=
.

If b = 2 .

0 she 2
: . n =

2g -1k
,

i. Possible remainders are 0


,
1 .

be 2
2g -11

can or
• . n
q .

Case I If 2g
-

n=

i. ri -
n = ② g) 2- 2q
= 4
q2 -

2q
= 2 ( 2 of g) -

which is divisible
.
by 2 .

Case II
If n=
2g -11
-

i. ri -
n =
( 2g 1- Ñ +
2g -11
26 g) (1) G) 2-1
= (
2q7 '
+ +
2g -11
=

4g +
4g -1 It 2g -11
=

492 +
Gq -12
= 2
(292+39+1)
which is divisible
by 2 .

From ri
i. ease I & II
,
-
n is divisible
by 2 .
For any positive integer n, prove that n3– n is divisible by 6.
: 2
If n is an odd integer, then show that n -1 is divisible by 8.

Q Show that one and only one out of n, (n + 1) and (n + 2) is divisible by 3, where n is
any positive integer.

Exercise -

1.2

Theorem Fundamental theorem edrithmetic


1. 2-
of

Every composite number can be


escpressed Cfactorised as a

atom is
product of primes ,
& this
factories unique , apart from
which the
the order in
prime factors occur .

Example -
8232

2 8232
2 4116

2 2058

3 1029
7 343
7 49
7 7

i. Prime factors of 8232


8232 = 2×2×2×3157 ✗ 7×7
= 22×3 ✗ 73

HCF -

Product of the smallest


power of
each common
prime
the numbers
factor in .

Product of the each


LCM -

involved in the numbers


power greatest .
of prime factor ,

For two
positive integers a & b,
any

HCF La b) ,
X LCM La ,
b) =
a ✗b
Type 1 -

Q Express 2120 as the


product of its
prime factors .

2 2120

2 1060

5 530
2 1 06

53 53

Prime
I.
factors of 2120 = 2×2 ✗ 5×2×53

= 23×5×53

:
Express 9696 as the product of its prime factors.
5
9696= 2 x 3 x 101

Express 87456 as the product of its prime factors.


5
87456 = 2 x 3 x 911

Type 2-
Q Find the
Product
HCF &
the
LCM of 404 & 96 and
verify HCF ✗ 2cm =

of two
given numbers .

A Factors of 404 =
2×2 ✗ 101 = 22×101
Factors 96 2×2×2 ✗ 2×2×3 25×3
of = =

HCF ( 404,96) = 22=4


LCM ( 404,96) = 22 × 23×3×101 = 9696 .

Verification -

HCF X LCM = 4×9696 = 38784


Products 404 & 96
of = 404×96
= 38784

i. HCF ✗ LCM =
Product of numbers .

Hence
verified .

Q Find the HCF & LCM of 96 and 360 and verify HCF X LCM = Product of the
two given numbers.
HCF = 24
LCM = 1440
:
Find the HCF & LCM of 90 & 144 and verify HCF X LCM = Product of the two
given numbers.
HCF = 18
LCM = 720

Find the HCF & LCM of 12, 30 and 144.


HCF = 6
LCM = 720

Type 3-
Q Given that HCF ( 306 ,
131 4) = 18 .
Find the LCM (306 ,
)
1314 .

A HCF X LCM = Product of the number


18 X LCM = 306 ✗ 1314
17

LCM = 3¥36 ✗ 1314

☒91
,

= IT ✗ 1314
LCM
22,33¥
=

Q The HCF & LCM of two numbers are 9 and 360 respectively. If one number is 45,
write the other number.
Other number = 72

:
The HCF of 45 and 105 is 15. Write their LCM.
LCM = 315

The LCM of two numbers is 14 times their HCF. The sum of LCM & HCF is 600. If
one number is 280, then find the other number.
Other number = 80

Type 4 -

"
Q Show Anat 12 cannot end with the
digit 0 or 5
for any
natural number n .

"
A 12th =
(22×3)
= 22h ✗ 3m

Fmdamenlat theorem auithematics


By of
The number which ends with is divisible
0 or 5 ,
by 5 .
" "
But does not have Thus
12 5 as
factor .
,
12 cannot end with
natural number
0 or 5
for any n .

:
Show that the number 4 , when n is a natural number can not end with the digit zero.
n
Show that the number 7 cannot end with the digit zero, for any natural number n.

Type 5-

Q Explain why 7×13×11+11 and ( 7×6×5×4 ✗ 3×2×1 ) -13 are

composite numbers .

A 7×13×11+11 =
11 (7×13×1+1)
=
11 (7×13+1)
=
11 (91+1)--11 ( 92)
=
11×2×2×23

Since ,
7×13×11+11 has more than 2
factors other than 1 .

i. 7×13×11+11 is a
composite number .

⑨ ✗ 6×5 ✗ 4×3×2×1 ) -13 =


3 (T ✗ 6×5×4×1 ✗ 2×1 + 1)
= 3 (1680-11) = 3 ( 1681)
=
3×41×41

Since , @ ✗ 6×5×4 ✗ 3×2×1 ) -13 has 2


factors other than 1 .

e. .
G✗ 6×5×4 ✗ 3×2×1 ) -13 is a
composite number .

:
Explain why 3 x 5 x 7 + 7 is a composite number.

Explain why the number 7 x 5 x 3 x 2 + 3 is not a prime number.

Type 6-

Q Find the numbers b in


missing a, ,
cold the
given factor
tree .

18018

2 9009

a 3003

3 1001

b 143

C d
A 9009 = a ✗ 3003
i. A =
900£ = 3
3003

1001 = b ✗ 143
i. b 7
10,91-3
= =

143 =
cxd .

143 = 11×13
! a C- -
11 D= 13 or G- 13 D= 11
, ,

:
Complete the following factor tree & find the composite number x.

3 195

3 y
x = 585
5 13

Complete the following factor tree & find the composite number x.

2 3381

3 ?

7 161

7 ? x = 6762

Type 7-

Q intervals
Three bells tolls at
of 9 ,
12,15 minutes
respectively .

If they start tolling together after ,


what time
they next toll

together ?
A Factors 9 3×3--32
of
=

Factors of 12 =
2×2×3 22×3 =

Factors
of 15 = 3×5

f. LCM (9 ,
12 ,
15 ) = 22 × 32×5 = 180
180 minutes
i. The bells will toll
together after .
:
On morning walk, three persons step off together and their steps measure 40 cm,
42 cm and 4cm, respectively. What is the minimum distance each should walk so
that each can cover the same distance in complete steps?
2520 cm

A circular field has a circumference of 360 km. Three cyclists start together and can
cycle 48, 60 and 72 km a day, round the field. When will they meet again ?

720km

hscercise -
1.3

Theorem 1.3 -

'
Let p be a
prime number If .

p
divides a
,
then p divides a
,

where a is
positive integer .

Theorem 1.4 -
52 is irrational .

Proof -
Let 52 be rational number

52 =

ay ,
b -1-0 ,
a & b are co
prime
-
.



.
Rb = a .

Squaring on both sides

"

¢2 b) = of
2 b- = at -

! .
2 divides at
: .
2 divides a .
-


where in ①
substituting a = 2C
,
c is an
integer ,
eq .
.

②I
"
i. 2b =

2 b2 = ↳ E
b' 2d

=
=

: .
2 divides b2
e. . 2 divides b -


& ③
From eq ② .
we
get
2 divides a & b.
2 is a common
factor of a 2b .
But it contradicts that a & b are co -

prime
ie Our assumption is
wrong .

: . Fr is irrational .

Q Show that Fs is irrational

Q show that 58 is irrational

Q show that is irrational


Igg
Type 2-
Q Show etat 4- 552 is an irrational number .

A 552 be national
Proof -
Let 4- number

4- 552 b -1-0, & b


=

ay ,
a are co -

prime .

552 4
ay
= -

552
4b-÷
=

52
4bg÷
=

eds is national number


÷
is national number
4bg÷
i.

.
°

.
52 is rational number

But it contradicts that Fr is irrational .

i. Our assumption wrong


is .

i. 4- 552 is irrational .

Q Show that 3ft is an irrational number .

Q Show that 253-1 is an irrational number .

Q show that 2- 55 is an irrational number .


lesecercise -
1.4

Theorem 1. 5-

Let se be a rational number whose decimal expansion terminates ,

then se can be expressed in the form Plq ,


where p & q are

2^5?
co
prime
-

,
& the
prime factories ation of q is
of the
form
where n & m are non -

negative integers .

Theorem 1. 6-

Let be rational number such that the prime factoriesaction


n=
Plq a
,
2^5 ? where n.sn are non
of
Then
q
is
of
has
the
form
which terminates
-

negative integers .

se a decimal
expansion .

Theorem 1.7 -

Let where &


primes be rational number such
a-
Play , p q are co -

,
a
,
2h5m where
that the prime factories atom
of q is not
of the
form ,
n
,

Then
m are non
negative integers (
-
.

,
se has a decimal
expansion which
is non
terminating repeating recurring
-

Type l -

Q without
actually performing the
long division .
state whether the
following
national numbers will have decimal
a
terminating enpansion or a

decimal
non
terminating repeating expansion
-
.

is
%¥o
5 1250

A 125£
12,25%0
= 5 250

2×54 5 50

5 10

Since the denominator is I 5m


of the
form 2 2

has
terminating decimal expansion
i. 1251 a .
I

if Igo Terminating

]
iii B- Non-terminating repeating
875

if
¥ÉÑ
Non-terminating repeating

3¥ Non-terminating repeating

vi ] 41 Terminating
500

Type 2-

Q Write down the decimal


division .
expansion of the
following without actual

it
¥-0

I××e
A
22¥
= 27 =

= = 27.112£
104

2700×08-0 #
=
=

10000

0.021--6
=

0.00512
3¥25

2%5×-5 0.375

if 1.512
1%-5

Type 3 -

Q the number 0.317-8 in rational number


Express the
form of
Plq .

A Let n= 0.317T

i. se = 0.3178178178 . . .
. . .
-


sides
Multiplying both
by 10
,
we
get
lose = 3 .
178178178 .
. . .
. .
-


sides ①
Multiplying both
of eq .

by 10000

100002 =
3178 .
178178 . . . . .
-


② from ③
subtracting eq .

eq .

10000N -
lose =
3178.178178 . .
. . .
-

3.178178178 .
. .
. .

9990k =
3175
a =
3175
to

i.
Egg
a-

Q Express the number 9.TT in the form of rational number p/q.

Express the number 0.14T in the form of rational number p/q. I


99

ellis cutaneous

The decimal expansion of the rational number 43 will terminate after how many
places of decimals? 2453 4

0 State whether the number


£}¥5 will have terminating decimal expansion or non-

terminating repeating decimal expansion? Non -

terminating repeating
0 Find the largest number that will divide 398, 436 and 542 leaving remainders 7, 11,
and 15 respectively. 17

Q Express 98 as a product of its primes 2×72

Q If the HCF of 408 and 1032 is expressible in the form 1032 × 2 + 408 × p, then find
the value of p. p=
-5

0 HCF and LCM of two numbers is 9 and 459 respectively. If one of the numbers is 27,
find the other number. 153

Find HCF and LCM of 13 and 17 by prime factorisation method. HCF -4 ,


LCM =
221
2 2 2
⑨ Find LCM of numbers whose prime factorisation are expressible as 3 × 5 and 3 × 7.
11025

Find the LCM of 96 and 360 by using fundamental theorem of arithmetic. 1440

Find the HCF (865, 255) using Euclid’s division lemma. HCF=5

0 Find the largest number which divides 70 and 125 leaving remainder 5 and 8
respectively. 13

Find the prime factorisation of the denominator of rational number expressed as 6. II


in the simplest form. 3×11

:
Prove that 2 + 3√5 is an irrational number

Explain why (17 × 5 × 11 × 3 × 2 + 2 × 11) is a composite number?


n

Check whether 4 can end with the digit 0 for any natural number n.

0 Prove that √5 is irrational and hence show that 3 + √5 is also irrational.

:
Prove that 3 + 2√3 is an irrational number.

The length, breadth, and height of a room are 8 m 50 cm, 6 m 25 cm and 4 m 75 cm


respectively. Find the length of the longest rod that can measure the dimensions of
the room exactly. 25cm

0 Three alarm clocks ring at intervals of 4, 12 and 20 minutes respectively. If they


start ringing together, after how much time will they next ring together? 60min

0 In a school, there are two Sections A and B of class X. There are 48 students in
Section A and 60 students in Section B. Determine the least number of books required
for the library of the school so that the books can be distributed equally among all
students of each Section. 240 books

0 By using Euclid’s algorithm, find the largest number which divides 650 and 1170.
130

0 Find the HCF of 255 and 867 by Euclid’s division algorithm. 51

0 There are 104 students in class X and 96 students in class IX in a school. In a house
examination, the students are to be evenly seated in parallel rows such that no two
adjacent rows are of the same class.

(a) Find the number of students of class IX and also of class X in a row. 8

(b) Find the maximum number of parallel rows of each class for the seating arrangement.
25
0 Dudhnath has two vessels containing 720 ml and 405 ml of milk respectively. Milk
from these containers is poured into glasses of equal capacity to their brim. Find the
minimum number of glasses that can be filled • 25

0 Amita, Sneha, and Raghav start preparing cards for all persons of an old age home.
In order to complete one card, they take 10, 16 and 20 minutes respectively. If all of
them started together, after what time will they start preparing a new card together?
80 mins

0 Find HCF of numbers 134791, 6341 and 6339 by Euclid’s division algorithm. 1

① 2 3
If two positive integers x and y are expressible in terms of primes as x = p q and
3
y = p q, what can you say about their LCM and HCF. Is LCM a multiple of HCF?

:
Show that one and only one out of n, (n + 1) and (n + 2) is divisible by 3, where n is
any positive integer.

Find the HCF and LCM of 306 and 657 and verify that LCM × HCF = Product of the
two numbers. HCF -9 -

LCM =
22338
Downloaded from Tabahi Tenthies
Join Now. Click Here!

Visit the Official Channel – Click Here


Try Our Study Material Bot – Click Here
Join our Database Channel – Click Here

Disclaimer:
We don't own any material that is shared here. We have
just forwarded the materials that are already available in
Telegram or on Internet! If you are the rightful owner of
any contents posted here, and object to them being
displayed or if you are one of representativities of
copyrights department and you don’t like your Content
to be here, Please Contact Us at
@Contact_TabahiTenthies_Bot
We will remove it in 24-48 hour!

You might also like