MATHEMATICS Chapter 1: Real Numbers

r
Si
e em
ad
N
d
M

Mohammad Nadeem PGT Mathematics - 6379102396

 REAL NUMBERS
01

Real Numbers

Euclid’s Division Lemma:

Given positive integers a and b, there exists unique integers q and r satisfying a = bq + r,
where 0 ≤ r < b
➢ Lemma is a proven statement used for proving another statement.
Euclid’s Division Lemma states that given two integers a and b, there exists a unique pair of
integers q and r such that a = b × q + r and 0 ≤ r < b.
This lemma is essentially equivalent to: dividend = divisor × quotient + remainder

r
In other words, for a given pair of dividend and divisor, the quotient and remainder

Si
obtained are going to be unique.

Euclid’s Division Algorithm:

➢ An algorithm is a series of well defined steps which gives a procedure for solving a
type of problem.
em
➢ This algorithm is a technique to compute the H.C.F of two given positive integers.
➢ According to this algorithm, the HCF of any two positive integers ‘a’ and ‘b’, with a >
b, is obtained by following the steps given below:
e
Step 1: Apply Euclid’s division lemma, to ‘a’ and ‘b’, to find q and r, such that a = bq + r, 0 ≤ r
< b.
ad

Step 2: If r = 0, the HCF is b. If r ≠ 0, apply Euclid’s division lemma to b and r.

Step 3: Continue the process till the remainder is zero. The divisor at this stage will be HCF
(a, b). Also, note that HCF (a, b) = HCF (b, r).
N

Euclid’s Division Algorithm can be summarized as follows:

d
M

Mohammad Nadeem PGT Mathematics - 6379102396 (1)

 REAL NUMBERS
01

➢ Euclid’s Division Algorithm is stated for only positive integers but it can be extended
for all integers except zero, i.e., b ≠ 0.
Consider two numbers 78 and 980 and we need to find the HCF of these numbers. To do
this, we choose the largest integer first, i.e. 980 and then according to Euclid Division
Lemma, a = bq + r where 0 ≤ r < b;
980 = 78 × 12 + 44
Now, here a = 980, b = 78, q = 12 and r = 44.
Now consider the divisor 78 and the remainder 44, apply Euclid division lemma again.
78 = 44 × 1 + 34

r
Similarly, consider the divisor 44 and the remainder 34, apply Euclid division lemma to 44

Si
and 34.
44 = 34 × 1 + 10
Following the same procedure again,
34 = 10 × 3 + 4
10 = 4 × 2 + 2
4=2×2+0
em
As we see that the remainder has become zero, therefore, proceeding further is not
e
possible. Hence, the HCF is the divisor b left in the last step. We can conclude that the HCF
of 980 and 78 is 2.
ad

Let us try another example to find the HCF of two numbers 250 and 75. Here, the larger the
integer is 250, therefore, by applying Euclid Division Lemma a = bq + r where 0 ≤ r < b, we
have
N

a = 250 and b = 75
⇒ 250 = 75 × 3 + 25
By applying the Euclid’s Division Algorithm to 75 and 25, we have:
d

75 = 25 × 3 + 0
As the remainder becomes zero, we cannot proceed further. According to the algorithm, in
M

this case, the divisor is 25. Hence, the HCF of 250 and 75 is 25.

Real Numbers:
p
➢ The numbers which can be represented in the form , of where p and q are integers
q
and q ≠ 0 are called Rational numbers.
p
➢ Any number that cannot be expressed in the , form of , where p and q are integers
q
and q ≠ 0 are called Irrational numbers.
➢ There are more irrational numbers than rational numbers between two consecutive
numbers.

Mohammad Nadeem PGT Mathematics - 6379102396 (2)

 REAL NUMBERS
01

➢ Rational and Irrational numbers together constitute Real numbers.

Properties of Irrational numbers:

i. The Sum, Difference, Product and Division of two irrational numbers need not
always be an irrational number.
ii. Negative of an irrational number is an irrational number.
iii. Sum of a rational and an irrational number is irrational.
iv. Product and Division of a non-zero rational and irrational number is always irrational.

Fractions:

r
➢ Terminating fractions are the fractions which leaves remainder 0 on normal division.

Si
➢ Recurring fractions are the fractions which never leave a remainder 0 on normal
division.

Properties related to prime numbers:

em
➢ If p is a prime and divides a2, then p divides a, where ‘a’ is a positive integer.
➢ If p is a prime, then √p is an irrational number.
➢ A number ends with the digit zero if and only if it has 2 and 5 as two of its prime
factors.
e
1. Decimal Expansion:
ad

➢ The decimal expansion of rational number is either terminating or non-terminating

recurring (repeating).
➢ If the decimal expansion of rational number terminates, then we can express the
p
N

number in the form of , where p and q are co-prime, and the prime factorization of
q
q is of the form 2n5m, where n and m are non negative integers.
p
➢ If x = is a rational number, such that the prime factorization of q is of the form
d

q
2n5m, where n, m are non-negative integers. Then, x has a decimal expansion which
terminates.
M

➢ If the denominator of a rational number is of the form 2 n5m, then it will terminate
after n places if n > m or after m places if m > n.
➢ The decimal expansion of an irrational number is non-terminating, non-recurring.

Fundamental Theorem of Arithmetic:

Every composite number can be expressed (factorized) as a product of primes, and this
factorization is unique, apart from the order in which the prime factors occur.
The procedure of finding HCF (Highest Common Factor) and LCM (Lowest Common
Multiple) of given two positive integers a and b:

Mohammad Nadeem PGT Mathematics - 6379102396 (3)

 REAL NUMBERS
01

i. Find the prime factorization of given numbers.

ii. HCF (a, b) = Product of the smallest power of each common prime factors in the
numbers.
iii. LCM (a, b) = Product of the greatest power of each prime factors, involved in the
numbers.
Fundamental Theorem of Arithmetic states that every integer greater than 1 is either a
prime number or can be expressed in the form of primes. In other words, all the natural
numbers can be expressed in the form of the product of its prime factors. To recall, prime
factors are the numbers which are divisible by 1 and itself only. For example, the number

r
35 can be written in the form of its prime factors as:

Si
35 = 7 × 5
Here, 7 and 5 are the prime factors of 35
Similarly, another number 114560 can be represented as the product of its prime factors by
using prime factorization method,
114560 = 27 × 5 × 179 em
So, we have factorized 114560 as the product of the power of its primes.
Therefore, every natural number can be expressed in the form of the product of the power
of its primes. This statement is known as the Fundamental Theorem of Arithmetic, unique
e
factorization theorem or the unique-prime-factorization theorem.
ad
N
d
M

Proof for Fundamental Theorem of Arithmetic: In number theory, a composite number is

expressed in the form of the product of primes and this factorization is unique apart from
the order in which the prime factor occurs.
From this theorem we can also see that not only a composite number can be factorized as
the product of their primes but also for each composite number the factorization is unique,
not taking into consideration order of occurrence of the prime factors.
In simple words, there exists only a single way to represent a natural number by the

Mohammad Nadeem PGT Mathematics - 6379102396 (4)

 REAL NUMBERS
01

product of prime factors. This fact can also be stated as:

The prime factorization of any natural number is said to be unique for except the order of
their factors.
In general, a composite number “a” can be expressed as,
a = p1 p2 p3 ………… pn, where p1, p2, p3 ………… pn are the prime factors of a written in
ascending order i.e. p1 ≤ p2 ≤ p3 ………… ≤pn.
Writing the primes in ascending order makes the factorization unique in nature.

Relationship between HCF and LCM of two numbers:

r
If a and b are two positive integers, then HCF (a, b) × LCM (a, b) = a × b

Si
Relationship between HCF and LCM of three numbers:
p. q. r . HCF (p, q, r )
LCM (p, q, r ) =
HCF (p, q). HCF (q, r ). HCF (p, r )

HCF (p, q, r ) = em
p. q. r . LCM (p, q, r )
LCM (p, q). LCM (q, r ). LCM (p, r )
Method of Finding LCM
In Mathematics, the LCM of any two is the value that is evenly divisible by the two given
e
numbers. The full form of LCM is Least Common Multiple. It is also called the Least
Common Divisor (LCD). For example, LCM (4, 5) = 20. Here, the LCM 20 is divisible by both 4
ad

and 5 such that 4 and 5 are called the divisors of 20.

LCM is also used to add or subtract any two fractions when the denominators of the
fractions are different. While performing any arithmetic operations such as addition,
subtraction with fractions, LCM is used to make the denominators common. This process
N

makes the simplification process easier.

Least Common Multiple (LCM) is a method to find the smallest common multiple between
any two or more numbers. A common multiple is a number which is a multiple of two or
d

more numbers.
Properties of LCM
M

Properties Description

Associative property LCM (a, b) = LCM (b, a)

Commutative property LCM (a, b, c) = LCM (LCM(a, b), c) = LCM(a, LCM(b, c))

Mohammad Nadeem PGT Mathematics - 6379102396 (5)

 REAL NUMBERS
01

Distributive property LCM (da, db, dc) = d LCM (a, b, c)

LCM Formula
Let a and b are two given integers. The formula to find the LCM of a & b is given by:
LCM (a, b) = (a x b)/GCD (a, b)
Where GCD (a, b) means Greatest Common Divisor or Highest Common Factor of a & b.
LCM Formula for Fractions

r
The formula to find the LCM of fractions is given by:

Si
L.C.M. = L.C.M Of Numerator/H.C.F Of Denominator
Different Methods of LCM
There are three important methods by which we can find the LCM of two or more numbers.
They are:
Listing the Multiples
Prime Factorization Method
em
Division Method
e
Listing the Multiples: The method to find the least common multiple of any given numbers
is first to list down the multiples of specific numbers and then find the first common
ad

multiple between them.

Suppose there are two numbers 11 and 33. Then by listing the multiples of 11 and 33, we
get;
Multiples of 11 = 11, 22, 33, 44, 55, ….
N

Multiples of 33 = 33, 66, 99, ….

We can see, the first common multiple or the least common multiple of both the numbers
d

is 33. Hence, the LCM (11, 33) = 33.

LCM By Prime Factorization: Another method to find the LCM of the given numbers is
M

prime factorization. Suppose there are three numbers 12, 16 and 24. Let us write the prime
factors of all three numbers individually.
12 = 2 x 2 x 3
16 = 2 x 2 x 2 x 2
24 = 2 x 2 x 2 x 3
Now writing the prime factors of all the three numbers together, we get;
12 x 16 x 24 = 2 x 2 x 3 x 2 x 2 x 2 x 2 x 2 x 2 x 2 x 3
Now pairing the common prime factors we get the LCM. Hence, there are four 2’s and one
3. So the LCM of 12, 16 and 24 will be;

Mohammad Nadeem PGT Mathematics - 6379102396 (6)

 REAL NUMBERS
01

LCM (12, 16, 24) = 2 x 2 x 2 x 2 x 3 = 48

LCM By Division Method
• Finding LCM of two numbers by division method is an easy method. Below are the
steps to find the LCM by division method:
• First, write the numbers, separated by commas
• Now divide the numbers, by the smallest prime number.
• If any number is not divisible, then write down that number and proceed further
• Keep on dividing the row of numbers by prime numbers, unless we get the results as

r
1 in the complete row

Si
• Now LCM of the numbers will be equal to the product of all the prime numbers we
obtained in the division method
Example: To find the Least Common Multiple (L.C.M) of 36 and 56,
36 = 2 × 2 × 3 × 3
56 = 2 × 2 × 2 × 7
The common prime factors are 2 × 2
em
The uncommon prime factors are 3 × 3 for 36 and 2 × 7 for 56.
e
LCM of 36 and 56 = 2 × 2 × 3 × 3 × 2 × 7 which is 504
Method of Finding HCF
ad

H.C.F can be found using two methods – Prime factorisation and Euclid’s division algorithm.
Prime Factorisation: Given two numbers, we express both of them as products of their
respective prime factors. Then, we select the prime factors that are common to both the
N

numbers
Example – To find the H.C.F of 20 and 24
20 = 2 × 2 × 5 and 24 = 2 × 2 × 2 × 3
d

The factor common to 20 and 24 is 2 × 2, which is 4, which in turn is the H.C.F of 20 and 24.
Euclid’s Division Algorithm: It is the repeated use of Euclid’s division lemma to find the
M

H.C.F of two numbers.

Example: To find the HCF of 18 and 30

Mohammad Nadeem PGT Mathematics - 6379102396 (7)

 REAL NUMBERS
01

r
Si
HCF by Shortcut method
Steps to find the HCF of any given numbers.
Step 1: Divide larger number by smaller number first, such as;
Larger Number/Smaller Number em
Step 2: Divide the divisor of step 1 by the remainder left.
Divisor of step 1/Remainder
Step 3: Again divide the divisor of step 2 by the remainder.
e
Divisor of step 2/Remainder
ad

Step 4: Repeat the process until the remainder is zero.

Step 5: The divisor of the last step is the HCF.
N
d
M

Mohammad Nadeem PGT Mathematics - 6379102396 (8)

 REAL NUMBERS
01

r
Si
e em
ad
N
d
M

Mohammad Nadeem PGT Mathematics - 6379102396 (9)

 REAL NUMBERS
01

Important Questions

Multiple Choice questions-

1. HCF of 8, 9, 25 is

(a) 8

(b) 9

(c) 25

r
(d) 1

Si
2. Which of the following is not irrational?
2
(a) (2 – √3)

(b) (√2 + √3)

2

(c) (√2 − √3)(√2 + √3)

em
2√7
e
(d)
7
ad

3. The product of a rational and irrational number is

(a) rational

(b) irrational
N

(c) both of above

(d) none of above

d

4. The sum of a rational and irrational number is

M

(a) rational

(b) irrational

(c) both of above

(d) none of above

5. The product of two different irrational numbers is always

(a) rational

Mohammad Nadeem PGT Mathematics - 6379102396 (10)

 REAL NUMBERS
01

(b) irrational

(c) both of above

(d) none of above

6. The sum of two irrational numbers is always

(a) irrational

(b) rational

r
(c) rational or irrational

Si
(d) one

7. If b = 3, then any integer can be expressed as a =

(a) 3q, 3q+ 1, 3q + 2

(b) 3q

(c) none of the above

em
(d) 3q+ 1
e
8. The product of three consecutive positive integers is divisible by
ad

(a) 4

(b) 6
N

(c) no common factor

(d) only 1
d

9. The set A = {0,1, 2, 3, 4, …} represents the set of

(a) whole numbers

M

(b) integers

(c) natural numbers

(d) even numbers

10. Which number is divisible by 11?

(a) 1516

(b) 1452

Mohammad Nadeem PGT Mathematics - 6379102396 (11)

 REAL NUMBERS
01

(c) 1011

(d) 1121

Very Short Questions:

1. What is the HCF of the smallest composite number and the smallest prime
number?
6
2. The decimal representation of will terminate after how many places of
1250
decimal?

r
Si
3. If HCF of a and b is 12 and product of these numbers is 1800. Then what is
LCM of these numbers?

4. What is the HCF of 33 × 5 and 32 × 52?

5.

6.
the LCM of 3a and 2b? em
if a is an odd number, b is not divisible by 3 and LCM of a and b is P, what is

If P is prime number then, what is the LCM of P, P2, P3?

7. Two positive integers p and q can be expressed as p = ab 2 and q = a2b, a and b

e
are prime numbers. What is the LCM of p and q?
ad

8. A number N when divided by 14 gives the remainder 5. What is the remainder

when the same number is divided by 7?
17
9. Examine whether is a terminating decimal or not.
30
N

10. What are the possible values of remainder r, when a positive integer a is
divided by 3?
d

11. A rational number in its decimal expansion is 1.7351. What can you say about
p
the prime factors of q when this number is expressed in the form ? Give
q
M

reason.
987
12. Without actually performing the long division, find will have terminating
10500
or non. terminating repeating decimal expansion. Give reason for your answer.

Short Questions :
1. Can the number 4n, n be a natural number, end with the digit 0? Give reason.

2. Write whether the square of any positive integer can be of the form 3m + 2,
where m is a natural number. Justify your answer.

Mohammad Nadeem PGT Mathematics - 6379102396 (12)

 REAL NUMBERS
01

3. Can two numbers have 18 as their HCF and 380 as their LCM? Give reason.

4. An army contingent of 616 members is to march behind an army band of 32

members in a parade. The two groups are to march in the same number of
columns. What is the maximum number of columns in which they can march?

5. Find the LCM and HCF of 12, 15 and 21 by applying the prime factorisation
method.

6. Find the LCM and HCF of the following pairs of integers and verify that LCM ×
HCF = product of the two numbers.

r
(1) 26 and 91 (ii) 198 and 144

Si
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 from 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?

8.

(i)
35
(ii)
15
em
Write down the decimal expansiwns of the following numbers:

50 1600
e
𝑎
9. Express the number ̅̅̅̅̅̅̅̅̅
0.3178 in the form of rational number .
𝑏
ad

10. If n is an odd positive integer, show that (n 2 – 1) is divisible by 8.

11. The LCM of two numbers is 14 times their HCF. The sum of LCM and HCF is
600. If one number is 280, then find the other number.
N

12. Find the value of x, y and z in the given factor tree. Can the value of ‘x’ be
found without finding the value of ‘y’ and ‘z’? If yes, explain.
d
M

13. Show that any positive odd integer is of the form 6q + 1 or 6q + S or 6q + 5

where q is some integer.

14. The decimal expansions of some real numbers are given below. In each case,
decide whether they are rational or not. If they are rational, write it in the
p
form . What can you say about the prime factors of q?
q

Mohammad Nadeem PGT Mathematics - 6379102396 (13)

 REAL NUMBERS
01

(i) 0.140140014000140000… (ii) ̅̅̅̅̅̅

0.16

Long Questions :
1. Use Euclid’s division lemma to show that the square of any positive integer is
either of the form 3m or 3m + 1 for some integer m.

2. Show that one and only one out of n, n + 2, n + 4 is divisible by 3, where n is

any positive integer.

3. Use Euclid’s division algorithm to find the HCF of:

r
(i) 960 and 432

Si
(ii) 4052 and 12576.

4. Using prime factorisation method, find the HCF and LCM of 30, 72 and 432.
Also show that HCF × LCM ≠ Product of the three numbers.

5.

6.
Prove that √7 is an irrational number.

Show that 5 – √3 is an irrational number.

em
7. Using Euclid’s division algorithm, find whether the pair of numbers 847,2160
e
are co-prime or not.
ad

8. Check whether 6n can end with the digit O for any natural number n.

9. Show that there is iw positive integer n for which √n − 1 + √n + 1 is rational.

10. Find the largest positive integer that will divide 398, 436 and 542 leaving
N

remainders 7, 11 and 15 respectively.

Case Study Questions:

d

1. Srikanth has made a project on real numbers, where he finely explained the
applicability of exponential laws and divisibility conditions on real numbers. He
M

also included some assessment questions at the end of his project as listed below.
Answer them.

i. For what value of n, 4n ends in 0?

a. 10

b. When n is even.

c. When n is odd.

d. No value of n.

Mohammad Nadeem PGT Mathematics - 6379102396 (14)

 REAL NUMBERS
01

ii. If a is a positive rational number and n is a positive integer greater than I, then
for what value of n, 4n is a rational number?

a. When n is any even integer.

b. When n is any odd integer.

c. For all n > 1.

d. Only when n = 0.

iii. If x and y are two odd positive integers, then which of the following is true?

r
a. x2 + y2 is even.

Si
b. x2 + y2 is not divisible by 4.

c. x2 + y2 is odd.

d. Both (a) and (b).

em
iv. The statement 'One of every three consecutive positive integers is divisible by 3'
is:

a. Always true.
e
b. Always false.
ad

c. Sometimes true.

d. None of these.
N

v. If n is any odd integer, then n2 - 1 is divisible by:

a. 22
d

b. 55
M

c. 88

d. 8

2. Real numbers are extremely useful in everyday life. That is probably one of the main
reasons we all learn how to count and add and subtract from a very young age. Real
numbers help us to count and to measure out quantities of different items in various
fields like retail, buying, catering, publishing etc. Every normal person uses real numbers
in his daily life. After knowing the importance of real numbers, try and improve your
knowledge about them by answering the following questions on real life based
situations.

Mohammad Nadeem PGT Mathematics - 6379102396 (15)

 REAL NUMBERS
01

i. Three people go for a morning walk together from the same place. Their steps
measure 80cm, 85cm and 90cm respectively. What is the minimum distance
travelled when they meet at first time after starting the walk assuming that
their walking speed is same?

a. 6120cm
b. 12240cm
c. 4080cm
d. None of these

ii. ln a school Independence Day parade, a group of 594 students need to march

r
behind a band of 189 members. The two groups have to march in the same

Si
number of columns. What is the maximum number of columns in which they
can march?

a. 9
b. 6
c.
d.
27
29
em
iii. Two tankers contain 768 litres and 420 litres of fuel respectively. Find the
maximum capacity of the container which can measure the fuel of either tanker
e
exactly.
ad

a. 4 litres
b. 7 litres
c. 12 litres
d. 18 litres
N

iv. The dimensions of a room are 8m, 25cm, 6m, 75cm and 4m, 50cm. Find the
length of the largest measuring rod which can measure the dimensions of room
exactly.
d

a. 1m, 25cm
M

b. 75cm
c. 90cm
d. 1m, 35cm

v. Pens are sold in pack of 8 and notepads are sold in pack of 12. Find the least
number of pack of each type that one should buy so that there are equal
number of pens and notepads.

a. 3 and 2
b. 2 and 5
c. 3 and 4

Mohammad Nadeem PGT Mathematics - 6379102396 (16)

 REAL NUMBERS
01

d. 4 and 5

Assertion Reason Questions-

1. Directions: In the following questions, a statement of assertion (A) is followed by a
statement of reason (R). Mark the correct choice as:
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true and R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.

r
Assertion: 11 × 4 × 3 × 2 + 4 is a composite number.

Si
Reason: Every composite number can be expressed as product of primes.

2. Directions: In the following questions, a statement of assertion (A) is followed by a

statement of reason (R). Mark the correct choice as:
em
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true and R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
e
Assertion: If LCM = 350, product of two numbers is 25 × 70, then their HCF = 5
ad

Reason: LCM × product of numbers = HCF

N
d
M

Mohammad Nadeem PGT Mathematics - 6379102396 (17)

 REAL NUMBERS
01

Answer Key-
Multiple Choice questions-
1. (d) 1

2. (c) (√2 − √3)(√2 + √3)

3. (b) irrational

4. (b) irrational

r
5. (b) irrational

Si
6. (a) irrational

7. (a) 3q, 3q+ 1, 3q + 2

8. (b) 6

9. (a) whole numbers

10. (b) 1452

em
Very Short Answer :
e
1. Smallest composite number = 4
ad

Smallest prime number = 2

So, HCF (4, 2) = 2

N

2.
d

This representation will terminate after 4 decimal places.

M

3. Product of two numbers = Product of their LCM and HCF

⇒ 1800 = 12 × LCM
1800
⇒ LCM = = 150.
12

4. HCF of 33 × 5 and 32 × 52 = 32 × 5 = 45

5. 6P

6. P3

Mohammad Nadeem PGT Mathematics - 6379102396 (18)

 REAL NUMBERS
01

7. a2h2

8. 5, because 14 is multiple of 7.

Therefore, remainder in both cases are same.

9.

Since the denominator has 3 as its factor.

r
17

Si
∴ is a non4ermznatlng decimal.
30

10. According to Euclid’s division lemma

a = 3q + r, where O r < 3 and r is an integer.

11.
em
Therefore, the values of r can be 0, 1 or 2.

As 1.7351 is a terminating decimal number, so q must be of the

form 2m 5n, where in, n are natural numbers.
e
987 47
12. = and 500 = 22 × 53, so it has terminating decimal
10500 500
expansion.
ad

Short Answer :
1. if 4n ends with 0, then it must have 5 as a factor. But, (4) n = (22)n = 22n i.e., the
N

only prime factor.

of 4n is 2. Also, we know from the fundamental theorem of arithmetic that the

prime factorization of each number is unique.
d

∴ 4n can never end with 0.

M

2. No, because any positive integer can be written as 3q, 3q + 1, 3q + 2, therefore,

square will be

9q2 = 3m, 9q2 + 6q + 1 = 3(3q2+ 2q) + 1 = 3m + 1,

9q2 + 12q + 4 = 3(3q2+ 4q + 1) + 1 = 3m + 1.

3. No, because here HCF (18) does not divide LCM (380).

4. For the maximum number of columns, we have to find the HCF of 616 and 32.

Now, since 616 > 32, we apply division lemma to 616 and 32.

Mohammad Nadeem PGT Mathematics - 6379102396 (19)

 REAL NUMBERS
01

We have, 616 = 32 × 19 + 8

Here, remainder 8 ≠ O. So, we again apply division lemma to 32 and 8.

We have, 32 = 8 × 4 + O

Here, remainder is zero. So, HCF (616, 32) = 8

Hence, maximum number of columns is 8.

5. The prime factors of 12, 15 and 21 are

r
12 22 × 3, 15 = 3 × 5 and 21 = 3 × 7

Si
Therefore, the HCF of these integers is 3.

22, 31, 51 and 71 and are the greatest powers involved in the prime factors of 12,
15 and 21.

6. (i) We have, 26 = 2 × 13 and 91 = 7 × 13

em
So, LCM (12, 15, 21) = 22 × 31 × 51 × 71 = 420.

Thus, LCM (26, 91) = 2 × 7 × 13 = 182

e
HCF (26, 91) = 13
ad

Now, LCM (26, 91) × HCF (26, 91) = 182 × 13 = 2366

and Product of the two numbers = 26 × 91 = 2366

Hence, LCM × HCF = Product of two numbers.

N

(ii) 144 = 24 × 32 and 198 = 2 × 32 × 11

∴ LCM(198,144)24 × 32 × 11 = 1584
d

HCF(198, 144) = 2 × 32 = 18
M

Now, LCM (198, 144) × HCF (198, 144) = 1584 × 18 = 28512

and product of 198 and 144 = 28512

Thus, product of LCM (198, 144) and HCF (198, 144)

= Product of 198 and 144.

7. To find the time after which they meet again at the starting point, we have to
find LCM of 18 and 12 minutes. We have

Mohammad Nadeem PGT Mathematics - 6379102396 (20)

 REAL NUMBERS
01

Therefore, LCM of 18 and 12 = 22 × 32 = 36

So, they will meet again at the starting point after 36 minutes.

8. (i)

r
Si
(ii)
e em
ad

9. Let x = ̅̅̅̅̅̅̅̅̅
0.3178

then x = 0.3178178178 … … (i)

10x = 3.178178178 … …(ii)

N

10000x = 3178.178178… …(iii)

On subtracting (ii) from (iii), we get

d
M

10. We know that an odd positive integer n is of the form (4q + 1) or (4 + 3) for
some integer q.

Case – I When n = (4q + 1)

In this case n2 – 1 = (4q + 1)21 = 16q2 + 8q = 8q(2q + 1)

which is clearly divisible by 8.

Mohammad Nadeem PGT Mathematics - 6379102396 (21)

 REAL NUMBERS
01

Case – II When n = (4q + 3)

In this case, we have

n22 = (4q + 3)2 – 1 = 16q2 + 24q + 8 = 8(2q2+ 3q + 1)

which is clearly divisible by 8.

Hence (n2 – 1) is divisible by 8.

11. Let HCF of the numbers hex then according to question LCM of the number will
be 14x

r
And x + 14 = 600 ⇒ 15x = 600 ⇒ x = 40

Si
Then HCF = 40 and LCM = 14 × 40 = 560

∵ LCM × HCF = Product of the numbers

Then other number is 80.

em
560 × 40 = 280 × Second number Second number =
560×40
280
= 80

12. z = 2 × 17 = 34; y = 34 × 2 = 68 and x = 2 × 68 = 136

e
Yes, value of x can be found without finding value of y or z as
ad

x = 2 × 2 × 2 × 17 which arc prime 1tctors of x.

13. Let a he any positive odd integer and h = 6. Then, by Euclid’s algorithm, a = 6q +
r, for some
N

integer q ≥ O and O ≤ r < 6.

i.e., the possible remainders are 0, 1, 2, 3, 4, 5.

d

1’hus,a canbeoftheform6q,or6q + I,or6q + 2,orßq + 3,ör6q + 4,

M

or 6q + 5, where q is some quotient.

Since a. is odd integer, so a cannot be of the form , or + 2, or 6q + 4, (since they

are even).

Thus, a is of the form 6q + 1, 6q + 3, or 6q + 5, where q is some integer.

Hence, any odd positive integer is of the form 6q + 1 or 6q -1- 3 or 6q + 5,

where q is sorne integer.

14. (i) We have, 0.140140014000140000… a non-terminating and non-repeating

Mohammad Nadeem PGT Mathematics - 6379102396 (22)

 REAL NUMBERS
01

p
decimal expansion. So it is irrational. It cannot be written in the form of
q

(ii) We have, ̅̅̅̅̅̅

0.16 a non-terminating but repeating decimal expansion. So it is
rational.

Let x = ̅̅̅̅̅̅
0.16

Then, x = 0.1616… (i)

100x16.1616… ..(ii)

On subtracting (i) from (ii), we get

r
Si
100x – x = 16.1616 – 0.1616
16 p
⇒ 99x = 16 ⇒ x = =
99 q

The denominator (q) has factors other than 2 or 5.

Long Answer :
em
1. Let a be an arbitrary positive integer.
e
Then by Euclid’s division algorithm, corresponding to the positive integers a and
3 there exist
ad

non-negative integers q and r such that

a = 3q + r where 0 ≤ r <3
N

a2 = 9q2 + 6qr + r2 ….(i) 0 ≤ r <3

Case – I: When r = 0 [putting in (i)]

d

a2 = 9q2 = 3(3q2) = 3m where m = 3q2

Case – II: r = 1
M

a2 = 9q2 + 6q + 1 = 3(3q2 + 2q)+ 1 = 3m + 1 where m = 3q2 + 2q

Case – III: r = 2

a2 = 9q2 + 12 + 4 = 3(3q2 + 4q + 1) + 1 = 3m + 1 where m = (3q 2 + 4q + 1)

Hence, square of any positive integer is either of the form 3m or 3m + 1 for

some integer m.

2. Let q be the quotient and r be the remainder when n is divided by 3.

Mohammad Nadeem PGT Mathematics - 6379102396 (23)

 REAL NUMBERS
01

Therefore, n = 3q + r, where r = 0, 1, 2

n = 3q or n = 3q + 1 or n = 3q + 2

Case (i) if n = 3q, then n is divisible by 3, n + 2 and n +. 4 arc not divisible by 3.

Case (ii) if 71 = 3q + 1 then n + 2 = 3q + 3 = 3(q + 1), which is divisible by 3 and

n + 4 = 3q + 5, which is not divisible by 3.

So, only (n + 2) is divisible by 3.

r
Case (iii) If n = 3q + 2, then n + 2 = 3q + 4, which is not divisible by 3 and

Si
(n + 4) = 3q + 6 = 3(q + 2), which is divisible by 3.

So, only (n + 4) is divisible by 3.

Hence one and only one out of n, (n + 2), (n + 4), is divisible by 3.

3. em
(j) Since 960 > 432, we apply the division lemma to 960 and 432.

We have, 960 = 432 × 2 + 96

Since the remainder 96 ≠ 0, so we apply the division lemma to 432 and 96.
e
We have, 432 = 96 × 4 + 48
ad

Again remainder 48 ≠ 0 so we again apply division lemma to 96 and 48.

We have, 96 = 48 × 2 + O
N

The remainder has now become zero. So our procedure stops.

Since the divisor at this stage is 48.

d

Hence, HOE of 960 and 432 is 48.

i.e., HCF (960, 432) = 4H

M

(ii) Since 12576 > 4052, we apply the division lemma to 12576 and 4052, to get

12576 = 4052 × 3 + 420

Since the remainder 420 ≠ 0, we apply the division lemma to 4052 and 420, to
get

4052 = 420 × 9 + 272

We consider the new divisor 420 and the new remainder 272, and apply the
division lemma to get

Mohammad Nadeem PGT Mathematics - 6379102396 (24)

 REAL NUMBERS
01

420 = 272 × 1 + 148

We consider the new divisor 272 and the new remainder 148, and apply the
division lemma to get

272 = 148 × 1 + 124

We consider the new divisor 148 and the new remainder 124, and apply the
division lemma to get

148 = 124 × 1 + 24

r
We consider the new divisor 124 and the new remainder 24, and apply the

Si
division lemma to get

124 = 24 × 5 + 4

We consider the new divisor 24 and the new remainder 4, and apply the
division lemma to get

24 = 4 × 6 + O
em
The remainder has now become zero, so our procedure stops. Since the divisor
at this stage is 4, the HCF of 12576 and 4052 is 4.
e
4. Given members = 30, 72, 432 .
ad

30 = 2 × 3 × 5; 72 = 23 × 32 and 432 = 24 × 33

Here, 2’ and 31 are the smallest powers of the common factors 2 and 3
respectively.
N

So, HCF (30, 72, 432) = 21 × 31 = 2× 3 = 6

Again, 2, 33 and 51 arc the greatest powers of the prime factors 2, 3 and 5
d

respectively.
M

So, LCM (30, 72, 432) = 24 × 33 × 51 = 2160

HCF × LCM = 6 × 2160 = 12960

Product of numbers = 30 × 72 × 432 = 933120 .

Therefore, HCF × LCM ≠ Product of the numbers.

5. Let us assume, to the contrary, that √7 is a rational number.

Then, there exist co-prime positive integers and such that

𝑎
√7 = , b ≠ 0
𝑏

Mohammad Nadeem PGT Mathematics - 6379102396 (25)

 REAL NUMBERS
01

So, a = √7 b

Squaring both sides, we have

a2 = 7b2 …… (i)

⇒ 7 divides a2 ⇒ 7 divides a

So, we can write

a = 7c (where c is an integer)

r
Putting the value of a = 7c in (i), we have

Si
49c2 = 7b2 72 = b2

It means 7 divides b2 and so 7 divides b.

So, 7 is a common factor of both a and b which is a contradiction.

em
So, our assumption that √7 is rational is wrong.

Hence, we conclude that √7 is an irrational number.

6. Let us assume that 5 – √3 is rational.

e
So, 5 – √3 may be written as
ad

p
5 – √3 = , where p and q are integers, having no common factor except 1 and q
q
≠ 0.
N

p 5𝑞−𝑝
⇒ 5 – = √3 ⇒ √3 =
q 𝑞

5𝑞−𝑝
Since is a rational number as p and q are integers.
𝑞
d

∴ √3 is also a rational number which is a contradiction.

M

Thus, our assumption is wrong.

Hence, 5 – √3 is an irrational number.

7. Since 2160 > 847 we apply the division lemma to 2160 and 847

we have, 2160 847 × 2 + 466

Since remainder 466 ≠ 0. So, we apply the division lemma to 847 and 466

847 = 466 × 1+ 381

Mohammad Nadeem PGT Mathematics - 6379102396 (26)

 REAL NUMBERS
01

Again remainder 381 ≠ 0. So we again apply the division lemma to 466 and 381.

466 = 381 × 1 + 85

Again remainder 85 ≠0. So, we again apply the division lemma to 381 and 85

381 = 85 × 4 + 41

Again remainder 41 ≠ 0. So, we again apply the division lemma to 85 and 41.

85 = 41 × 2 + 3

r
Again remainder 3 ≠ 0. So, we again apply the division lemma to 4 1 and 3.

Si
41 = 3 × 13 + 2

Again remainder 2 ≠ 0. So, we again apply the division lemma to 3 and 2.

3=2×1+1
em
Again remainder 1 ≠ 0. So, we apply division lemma to 2 and 1

2=1×2+0

The remainder now becomes O. So, our procedure stops.

e
Since the divisor at this stage is 1.
ad

Hence, HCF of 847 and 2160 is 1 and numbers are co-prime.

8. If the number 6n, for any n, were to end with the digit zero, then h would bc
divisible by 5. That is, the prime factorisation of 6n would contain the prime 5.
N

But 6n = (2 × 3)n = 2n × 3n So the primes in factorisation of 6n are 2 and 3. So the

uniqueness of the Fundamental Theorem of Arithmetic guarantees that (here
are no other primes except 2 and 3 in the factorisation of 6n. So there is no
d

natural number n for which 6” ends with digit zero.

9. Let there be a positive integer n for which √𝑛 − 1 + √𝑛 + 1 be rational

M

number.

Mohammad Nadeem PGT Mathematics - 6379102396 (27)

 REAL NUMBERS
01

r
Si
e em
ad

⇒ √𝑛 − 1is also perfect. square of positive integer From (A) and (B)
N

√𝑛 + 1 and √𝑛 − 1 are perfect squares of positive integer. It contradict the fact

that two perfect squares differ at least by 3.

Hence, there is no positive integer n for which √𝑛 − 1 + √𝑛 + 1 is rational.

d

10. It is given that on dividing 398 by the required number, there is a remainder of
7. This means that 398 – 7 = 391 is exactly divisible by the required timber In
M

other words, required number is a factor of 391.

Similarly, required positive integer is a Íctor of 436 – 11 = 425 and 542 – 15 =

527

Clearly, the required number is the HCF of 391, 425 and 527.

Using the factor tree, we get the prime factorisations of 391, 425 and 527 as
follows:

391 = 17 × 23, 425 52 × 17 and 527 17 × 31

Mohammad Nadeem PGT Mathematics - 6379102396 (28)

 REAL NUMBERS
01

∴ HCF of 391, 425, and 527 is 17.

Hence, the required number = 17.

Case Study Answers:

1. Answer :

i. (d) No value of n.

Solution:

r
For a number to end in zero it must be divisible by 5, but 4n = 22n is never divisible by

Si
5. So, 4n never ends in zero for any value of n.

ii. (c) For all n > 1.

Solution:

So, a2 = a × a = rational number.

e em
We know that product of two rational numbers is also a rational number.

a3 = a2 × a = rational number.
ad

a4 = a3 × a = rational number.

......................................

......................................
N

an = an-1 × a = rational number.

iii. (d) Both (a) and (b).

d

Solution:
M

Let x = 2m + 1 and y = 2k + 1

Then x2 +y2 = (2m + 1)2 + (2k + 1)2

= 4m2 + 4m + 1 + 4k2 + 4k + 1

= 4(m2 + k2 + m + k) + 2

So, it is even but not divisible by 4.

iv. (a) Always true.

Mohammad Nadeem PGT Mathematics - 6379102396 (29)

 REAL NUMBERS
01

Solution:

Let three consecutive positive integers be n, n + 1 and n + 2.

We know that when a number is divided by 3, the remainder obtained is either 0 or

1 or 2.

So, n = 3p or 3p + 1 or 3p + 2, where pis some integer.

If n = 3p, then 2 is divisible by 3.

r
If n = 3p + 1, then n + 2 = 3p + 1 + 2 = 3p + 3 = 3(p + 1) is divisible by 3.

Si
If n = 3p + 2, then n + 1 = 3p + 2 + 1 = 3p + 3 = 3(p + 1) is divisible by 3.

So, we can say that one of the numbers among n, n + 1 and n + 2 is always divisible by
3.

v. (d) 8

Solution:
em
Any odd number is of the form of (2k + 1), where k is any integer.
e
So, n2 - 1 = (2k + 1)2 - 1 = 4k2 + 4k
ad

For k = 1, 4k2 + 4k = 8, which is divisible by 8.

Similarly, for k = 2, 4k2 + 4k = 24, which is divisible by 8.

N

And fork= 3, 4k2 + 4k = 48, which is also divisible by 8.

So, 4k2 + 4k is divisible by 8 for all integers k, i.e., n2 - 1 is divisible by 8 for all odd
values of n.
d

2. Answer :
M

i. (b) 12240cm

Solution:

Here 80 = 24 × 5, 85 = 17 × 5

and 90 = 2 × 32 × 5

L.C.M of 80, 85 and 90 = 24 × 3 × 3 × 5 × 17 = 12240

Mohammad Nadeem PGT Mathematics - 6379102396 (30)

 REAL NUMBERS
01

Hence, the minimum distance each should walk when they at first time is 12240cm.

ii. (c) 27

Solution:

Here 594 = 2 × 33 × 11 and 189 = 33 × 7

HCF of 594 and 189 = 33 = 27

Hence, the maximum number of columns in which they can march is 27.

r
iii. (c) 12 litres

Si
Solution:

Here 768 = 28 × 3 and 420 = 22 × 3 × 5 × 7

HCF of 768 and 420 = 22 × 3 = 12

em
So, the container which can measure fuel of either tanker exactly must be of 12 litres.

iv. (b) 75cm

e
Solution:
ad

Here, Length = 825cm, Breadth = 675cm and Height = 450cm

Also, 825 = 5 × 5 × 3 × 11, 675 = 5 × 5 × 3 × 3 × 3 and 450 = 2 × 3 × 3 × 5 × 5

N

HCF = 5 × 5 × 3 = 75

Therefore, the length of the longest rod which can measure the three dimensions of
the room exactly is 75cm.
d

v. (a) 3 and 2
M

Solution:

LCM of 8 and 12 is 24.

Assertion Reason Answer-

Mohammad Nadeem PGT Mathematics - 6379102396 (31)

 REAL NUMBERS
01

1. (a) Both A and R are true and R is the correct explanation of A.

2. (c) A is true but R is false.

r
Si
e em
ad
N
d
M

Mohammad Nadeem PGT Mathematics - 6379102396 (32)