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

0% found this document useful (0 votes)
121 views8 pages

Real Numbers - Class X

The document provides definitions and properties of real numbers, prime numbers, composite numbers, and co-prime numbers, along with concepts of divisibility and Euclid's division lemma. It explains the fundamental theorem of arithmetic, illustrating how every composite number can be expressed as a product of primes uniquely. Additionally, it includes examples and exercises related to these mathematical concepts.

Uploaded by

maliisarveshh05
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)
121 views8 pages

Real Numbers - Class X

The document provides definitions and properties of real numbers, prime numbers, composite numbers, and co-prime numbers, along with concepts of divisibility and Euclid's division lemma. It explains the fundamental theorem of arithmetic, illustrating how every composite number can be expressed as a product of primes uniquely. Additionally, it includes examples and exercises related to these mathematical concepts.

Uploaded by

maliisarveshh05
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/ 8

1 Real Numbers

DEFINITIONS

Real numbers : Numbers which can represent actual physical quantities in a meaningful way are known as real
numbers. These can be represented on the number line. Number line is geometrical straight line with arbitrarily
defined zero (origin).
Real numbers includes all rational and irrational numbers.

Prime numbers : All natural numbers that have one and itself only as their factors are called prime numbers i.e.
prime numbers are exactly divisible by 1 and themselves only. e.g. 2, 3, 5, 7, 11, 13, 17, 19, 23,...etc. If P is the set
of prime number then P = {2, 3, 5, 7,...}.

Composite numbers : All natural numbers, which are not prime are composite numbers. If C is the set of composite
number then C = {4, 6, 8, 9, 10, 12,...}.

Note : 1 is neither prime nor composite number.

Co-prime Numbers : If the H.C.F. of the given numbers (not necessarily prime) is 1 then they are known as co-
prime numbers. e.g. 4, 9 are co-prime as H.C.F. of (4, 9) = 1.

Note : Any two consecutive numbers will always be co-prime.

DIVISIBILITY
A non-zero integer ‘a’ is said to divide an integer ‘b’ if there exists an integer ‘c’ such that b = ac.
The integer ‘b’ is called dividend, integer ‘a’ is known as the divisor and integer ‘c’ is known as the quotient.
E.g. : 5 divides 35 because there is an integer 7 such that 35 = 5 × 7.
If a non-zero integer ‘a’ divides an integer b, then it is written as a|b and read as “ a divides b”, a b is
written to indicate that b is not divisible by a.

EUCLID’S DIVISION LEMMA

Let ‘a’ and ‘b’ be any two positive integers. Then, there exists unique integers ‘q’ and ‘r’ such that
a = bq + r, where 0  r < b. If b|a, then r = 0.

Ex. Show that any positive odd integer is of the form 6q + 1 or, 6q + 3 or, 6q + 5, where q is some integer.
Sol. Let ‘a’ be any positive integer and b = 6. Then, by Euclid’s division lemma there exists integers ‘q’ and ‘r’ such
that
a = 6q + r, where 0  r < 6.
 a = 6q or, a = 6q + 1 or, a = 6q + 2 or, a = 6q +3 or, a = 6q + 4 or, a = 6q + 5.
[  0  r < 6 r = 0, 1, 2, 3, 4, 5]
 a = 6q + 1 or, a = 6q +3 or, a = 6q + 5.
[ a is an odd integer,, a  6q, a  6q + 2, a  6q + 4]
Hence, any odd integer is of the form 6q + 1 or, 6q + 3 or, 6q + 5.

EUCLID’S DIVISION ALGORITHM


If ‘a’ and ‘b’ are positive integers such that a = bq + r, then every common divisor of ‘a’ and ‘b’ is a common divisor
of ‘b’ and ‘r’, and vice-versa.
Ex. Use Euclid’s division algorithm to find the H.C.F. of 196 and 38318.
Sol. Applying Euclid’s division lemma to 196 and 38318.
38318 = 195 × 196 + 98
196 = 98 × 2 + 0
The remainder at the second stage is zero. So, the H.C.F. of 38318 and 196 is 98.

Real Numbers 1
FUNDAMENTAL THEOREM OF ARITHMETIC

Every composite number can be expressed as a product of primes, and this factorisation is unique, except for the
order in which the prime factors occurs.

Some important results :


(i) Let ‘p’ be a prime number and ‘a’ be a positive integer. If ‘p’ divides a2, then ‘p’ divides ‘a’.
p
(ii) Let x be a rational number whose decimal expansion terminates. Then, x can be expressed in the form ,
q
where p and q are co-primes, and prime factorisations of q is of the form 2m × 5n, where m, n are non-negative
integers.
p
(iii) Let x = be a rational number, such that the prime factorisation of q is not of the form 2m × 5n, where m, n are
q
non - negative integers. Then, x has a decimal expansion which is non - terminating repeating.

Ex. Determine the prime factors of 45470971.


Sol.

 45470971 = 72 × 132 × 172 × 19.

2 Real Numbers
SOLVED EXAMPLE
Ex.1 Use Euclid’s Division Lemma to show that the cube of any positive integer is of the form 9 m, 9 m + 1 or
9 m + 8, for some integer m.
Sol. Let x be any positive integer. Then, it is of the form 3q or, 3q + 1 or, 3q + 2.
Case  When x = 3q
 x3 = (3q)3 = 27q3 = 9(3q3) = 9m, where m = 3q3.
Case when x = 3q + 1
 x3 = (3q + 1)3
 x3 = 27q3 + 27q2 + 9q + 1
 x3 = 9q (3q2 + 3q + 1) + 1
 x3 = 9m + 1, where m = q (3q2 + 3q + 1).
Case when x = 3q + 2
 x3 = (3q + 2)3
 x3 = 27q3 + 54q2 + 36q + 8
 x3 = 9q (3q2 + 6q + 4) + 8
 x3 = 9m + 8, where m = q (3q2 + 6q + 4)
Hence, x3 is either of the form 9 m or 9 m + 1 or 9 m + 8.
Ex. 2 Prove that the square of any positive integer of the form 5q + 1 is of the same form.
Sol. Let x be any positive integer of the form 5q + 1.
When x = 5q + 1
x2 = 25q2 + 10q + 1
x2 = 5q (5q + 2) + 1
Let m = q (5q + 2).
x2 = 5m + 1.
Hence, x2 is of the same form i.e. 5m + 1.
Ex.3 If the H.C.F of 657 and 963 is expressible in the form 657 x + 963 × (– 15), find x.
Sol. Applying Euclid’s division lemma on 657 and 963.
963 = 657 × 1 + 306
657 = 306 × 2 + 45
306 = 45 × 6 + 36
45 = 36 × 1 + 9
36 = 9 × 4 + 0
So, the H.C.F of 657 and 963 is 9.
Given : 657 x + 963 ×( – 15) = H.C.F of 657 and 963.
657 x + 963 × (– 15) = 9
657x = 9 + 963 × 15
657x = 14454
14454
x= = 22.
657

Ex.4 What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1, 2 and 3 respectively.
Sol. Clearly, the required number is the H.C.F of the numbers 626 – 1 = 625, 3127 – 2 = 3125 and 15628 – 3 = 15625.
Using Euclid’s division lemma to find the H.C.F. of 625 and 3125.
3125 = 625 × 5 + 0
Clearly, H.C.F. of 625 and 3125 is 625.
Now, H.C.F. of 625 and 15625
15625 = 625 × 25 + 0
So, the H.C.F of 625 and 15625 is 625.
Hence, H.C.F of 625, 3125 and 15625 is 625.
Hence, the required number is 625.

Real Numbers 3
Ex.5 144 cartons of coke cans and 90 cartons of pepsi cans are to be stacked in a canteen. If each stack is of
same height and is to contain cartons of the same drink, what would be the greatest number of cartons each
stack would have ?
Sol. In order to arrange the cartons of the same drink in the same stack, we have to find the greatest number that
divides 144 and 90 exactly. Using Euclid’s division algorithm, to find the H.C.F. of 144 and 90.
144 = 90 × 1 + 54
90 = 54 × 1 + 36
54 = 36 × 1 + 18
36 = 18 × 2 + 0
So, the H.C.F. of 144 and 90 is 18.
Number of cartons in each stack = 18.
Ex.6 Check whether 6n can end with the digit 0 for any natural number.
Sol. Any positive integer ending with the digit zero is divisible by 5 and 2 so its prime factorisations must contain
the prime 5.
 6n = (2 × 3)n = 2n × 3n
 The prime in the factorisation of 6n is 2 and 3.
 5 does not occur in the prime factorisation of 6n for any n.
 6n does not end with the digit zero for any natural number n.
Ex.7 Find the LCM and HCF of 84, 90 and 120 by applying the prime factorisation method.
Sol. 84 = 22 × 3 × 7, 90 = 2 × 32 × 5 and 120 = 23 × 3 × 5.
Prime factors Least exponent
2 1
3 1  HCF = 21 × 31 = 6.
5 0
7 0

Common prime factors Greatest exponent


2 3
 LCM = 23 × 32 × 51 × 71 = 8 × 9 × 5 × 7 = 2520.
3 2
5 1
7 1

Ex.8 In a morning walk three persons step off together, their steps measure 80 cm, 85 cm and 90 cm respectively.
What is the minimum distance each should walk so that they can cover the distance in complete steps ?
Sol. Required minimum distance each should walk so, that they can cover the distance in complete step is the
L.C.M. of 80 cm, 85 cm and 90 cm
80 = 24 × 5
85 = 5 × 17
90 = 2 × 32 × 5
 LCM = 24 × 32 × 51 × 171
LCM = 16 × 9 × 5 × 17
LCM = 12240 cm = 122 m 40 cm.

Ex.9 Prove that 2 is an irrational number..


Sol. Let assume on the contrary that 2 is a rational number..
a
Then, there exists positive integer a and b such that 2 =
b
where, a and b are coprimes i.e. their HCF is 1.
2
a
 ( 2 )2 =  
b
a2
 2=
b2
 a = 2b2
2

4 Real Numbers
 a2 is a multiple of 2
 a is a multiple of 2 .....(i)
Let a = 2c for some integer c.
 a2 = 4c2
 2b2 = 4c2
 b2 = 2c2
 b2 is a multiple of 2
 b is a multiple of 2 ....(ii)
From (i) and (ii), a and b have at least 2 as a common factor. But this contradicts the fact that a and b are
co-prime. This means that 2 is an irrational number..

Ex.10 Prove that 3 – 5 is an irrational number..

Sol. Let assume that on the contrary that 3 – 5 is rational.


Then, there exist co-prime positive integers a and b such that,
a
3– 5 =
b
a
 3– = 5
b
3b  a
 = 5
b
3b  a
 5 is rational [  a, b are integer 
b
is a rational number]
This contradicts the fact that 5 is irrational.
Hence, 3 – 5 is an irrational number..

13
Ex.11 Without actually performing the long division, state whether has terminating decimal expansion
3125
or not.
13 13
Sol. = 0
3125 2  55
This, shows that the prime factorisation of the denominator is of the form 2m × 5n.
Hence, it has terminating decimal expansion.

Ex.12 What can you say about the prime factorisations of the denominators of the following rationals :
(i) 43.123456789
(ii) 43 . 1 23456789
Sol. (i) Since, 43 .123456789 has terminating decimal, so prime factorisations of the denominator is of the
form 2m × 5n, where m, n are non - negative integers.
(ii) Since, 43 . 1 23456789 has non - terminating repeating decimal expansion. So, its denominator has
at least one distinct prime factor other than 2 or 5.

Real Numbers 5
EXERCISE - I

1. The [HCF × LCM] for the numbers 50 and 20 is :


(A) 10 (B) 100 (C) 1000 (D) 50

2. If the HCF of 85 and 153 is expressible in the form 85n – 153m, then value of n,m is :
(A) 69,90 (B) 69,68 (C) 40,20 (D) 30,40

31
3. The decimal expansion of the rational number 2 will terminate after :
2 5
(A) one decimal place (B) two decimal places
(C) three decimal places (D) more than three decimal places

4. Which of the following is a non-terminating repeating decimal ?

35 14 1 7
(A) (B) (C) (D)
14 35 7 8

5. If x = 23 × 3 × 52, y = 22 × 33, then HCF (x, y) is :


(A) 12 (B) 108 (C) 6 (D) 36

6. Given that HCF (253,440) = 11 and LCM (253, 440) = 253 × R. The value of R is :
(A) 400 (B) 40 (C) 440 (D) 253

7. If least prime factor of a is 3 and the least prime factor of b is 7, the least prime factor of (a + b) is :
(A) 2 (B) 3 (C) 5 (D) 11

8. Which is not an irrational number ?

(A) 5  3 (B) 2 5 (C) 4  2 (D) 6  9

9. How many prime factors are there in prime factorization of 5005.


(A) 2 (B) 4 (C) 6 (D) 7

10. The product of the HCF and LCM of the smallest prime number and the smallest composite number is :
(A) 2 (B) 4 (C) 6 (D) 8

6 Real Numbers
EXERCISE - II
1. Define Euclid’s Division Lemma.

2. Define Euclid’s Division Algorithm.

3. Define Fundamental Theorem of Arithmetic.

4. Without actually performing the long division, state whether the following rational number will have a terminating
77 15
decimal expansion or non - terminating decimal expansion : (i) (ii)
210 1600
5. Can we have any n N , where 7n ends with the digit zero.
6. Write a rational number between 2 and 3.

7. Find the [HCF × LCM] for the numbers 105 and 120.

8. Find the HCF and LCM of following using Fundamental Theorem of Arithmetic method.
(i) 426 and 576 (ii) 625, 1125 and 2125

9. Use Euclid’s division algorithm to find the HCF of : (i) 56 and 814 (ii) 6265 and 76254

10. Prove that 5 is irrational number..

11. Prove that 2  3 is irrational.

12. Prove that 3 + 2 is an irrational number..

2 45  3 20
13. Write whether on simplification gives a rational or an irrational number..
2 5
14. Find the least number which when divided by 6,7,8,9 and 12 leaves the remainder ‘1’ in each case.

15. 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 ?

16. 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 at 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 ?

17. 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.

18. (a) Explain why 7 × 11 × 13 + 13 is a composite number ?


(b) Explain why 7 × 6 × 5 × 4 × 3 × 2 × 1 + 5 is a composite number ?

19. A book seller purchased 117 books out of which 45 books are mathematics and remaining 72 books are of
physics. Each book has same size. Mathematics and physics books are to be packed in separate bundles
and each bundles must contain same number of books. Find the least number of bundles which can be
made for these 117 books.

20. Three sets of English, Hindi and Mathematics books have to be stacked in such a way that all the books are
stored subject-wise and the height of each stack is the same. The number of English books is 96, the
number of Hindi books is 240 and the number of Mathematics books is 336. Assuming that the books are of
the same thickness, determine the number of stacks of English, Hindi and Mathematics books.

Real Numbers 7
21. 105 goats, 140 donkey and 175 cows have to be taken across a river. There is only one boat which will
have to make many trips in order to do so. The lazy boatman has his own condition for transporting
them. He insists that he will take the same number of animals in every trip and they have to be of the
same kind. He will naturally like to take maximum possible number each time. Can you tell how many
animal went in each trip ?

22. Show that of the numbers n , n + 2 and n + 4 , only one of them is divisible by 3.

23. Let n = 640640640643, without actually computing n2 prove that n2 leave remainder 1 when divided by 8.

24. There is remainder of 3 when a number is divided by 6. What will be the remainder if the square of the same
number is divided by 6?

ANSWER KEY

EXERCISE - I

Que. 1 2 3 4 5 6 7 8 9 10
Ans. C B B C A B A D B D

EXERCISE - II
3
4. (i) Non-terminating (ii) Terminating 6. 7. 12600 8. (i) 6, 40896 (ii) 125, 95625
2

9. (i) 2, (ii) 179, 13. 6(Rational Number) 14. 505 15. 8 columns 16. 36 minutes

19. 13 20. 2, 5, 7 21. 35 24. 3

8 Real Numbers

You might also like