
REAL NUMBER
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
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
In other words, for a given pair of dividend and divisor, the quotient and remainder obtained are going to be unique.
Euclid’s Division Algorithm:
Step 1: Apply Euclid’s division lemma, to ‘a’ and ‘b’, to find q and r, such that a = bq + r, 0 ≤ r < b.
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).
Euclid’s Division Algorithm can be summarized as follows:
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
Similarly, consider the divisor 44 and the remainder 34, apply Euclid division lemma to 44 and 34.
44 = 34 × 1 + 10
Following the same procedure again,
34 = 10 × 3 + 4
10 = 4 × 2 + 2
4 = 2 × 2 + 0
As we see that the remainder has become zero, therefore, proceeding further is not 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.
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
a = 250 and b = 75
⇒ 250 = 75 × 3 + 25
By applying the Euclid’s Division Algorithm to 75 and 25, we have:
75 = 25 × 3 + 0
As the remainder becomes zero, we cannot proceed further. According to the algorithm, in this case, the divisor is 25. Hence, the HCF of 250 and 75 is 25.
Real Numbers:
Properties of Irrational numbers:
Fractions:
Properties related to prime numbers:
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:
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 35 can be written in the form of its prime factors as:
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
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 factorization theorem or the unique-prime-factorization theorem.
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 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:
If a and b are two positive integers, then HCF (a, b) × LCM (a, b) = a × b
Relationship between HCF and LCM of three numbers:
LCM (p, q, r )=p. q. r . HCF (p, q, r ) HCF (p, q).HCF (q, r ). HCF (p, r )
HCF (p, q, r )=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 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 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 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 more numbers.
Properties of LCM
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)) |
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
The formula to find the LCM of fractions is given by:
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
Division Method
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 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, ….
Multiples of 33 = 33, 66, 99, ….
We can see, the first common multiple or the least common multiple of both the numbers is 33. Hence, the LCM (11, 33) = 33.
LCM By Prime Factorization: Another method to find the LCM of the given numbers is 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;
LCM (12, 16, 24) = 2 x 2 x 2 x 2 x 3 = 48
LCM By 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
The uncommon prime factors are 3 × 3 for 36 and 2 × 7 for 56.
LCM of 36 and 56 = 2 × 2 × 3 × 3 × 2 × 7 which is 504
Method of Finding HCF
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 numbers
Example – To find the H.C.F of 20 and 24
20 = 2 × 2 × 5 and 24 = 2 × 2 × 2 × 3
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 H.C.F of two numbers.
Example: To find the HCF of 18 and 30
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
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.
Divisor of step 2/Remainder
Step 4: Repeat the process until the remainder is zero.
Step 5: The divisor of the last step is the HCF.
Important Questions
Multiple Choice questions-
1. HCF of 8, 9, 25 is
(a) 8
(b) 9
(c) 25
(d) 1
2. Which of the following is not irrational?
(a) (2 – √3)2
(b) (√2 + √3)2
(c) (√2 −√3)(√2 + √3)
(d) 2√77
3. The product of a rational and irrational number is
(a) rational
(b) irrational
(c) both of above
(d) none of above
4. The sum of a rational and irrational number is
(a) rational
(b) irrational
(c) both of above
(d) none of above
5. The product of two different irrational numbers is always
(a) rational
(b) irrational
(c) both of above
(d) none of above
6. The sum of two irrational numbers is always
(a) irrational
(b) rational
(c) rational or irrational
(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
(d) 3q+ 1
8. The product of three consecutive positive integers is divisible by
(a) 4
(b) 6
(c) no common factor
(d) only 1
9. The set A = {0,1, 2, 3, 4, …} represents the set of
(a) whole numbers
(b) integers
(c) natural numbers
(d) even numbers
10. Which number is divisible by 11?
(a) 1516
(b) 1452
(c) 1011
(d) 1121
Very Short Questions:
Short Questions :
(1) 26 and 91 (ii) 198 and 144
(i) 3550 (ii) 151600
(i) 0.140140014000140000… (ii) −0.16
Long Questions :
(i) 960 and 432
(ii) 4052 and 12576.
Case Study Questions:
Assertion Reason Questions-
Assertion: 11 × 4 × 3 × 2 + 4 is a composite number.
Reason: Every composite number can be expressed as product of primes.
Assertion: If LCM = 350, product of two numbers is 25 × 70, then their HCF = 5
Reason: LCM × product of numbers = HCF