JKBOSE Mathematics Chapter 1 Notes
Notes made by University Scope Team
0pt 0.4pt
Unit 1: REAL NUMBERS
1. Fundamental Theorem of Arithmetic (FTA)
Statement The **Fundamental Theorem of Arithmetic** states that every composite num-
ber can be expressed (factorized) as a product of primes, and this factorization is unique,
apart from the order in which the prime factors occur.
Illustrative Example Consider the composite number 156.
156 = 2 × 78
156 = 2 × 2 × 39
156 = 2 × 2 × 3 × 13
The prime factorization is 22 × 3 × 13. No matter how you start the factorization, the final set
of prime factors {2, 3, 13} and their powers will always be the same.
Application: Finding HCF and LCM The FTA is the basis for finding the Highest Common
Factor (HCF) and Lowest Common Multiple (LCM) of two or more positive integers using the
prime factorization method:
• HCF (Highest Common Factor): The product of the smallest power of each common
prime factor in the numbers.
• LCM (Lowest Common Multiple): The product of the greatest power of each prime
factor involved in the numbers.
Important Relation: For any two positive integers a and b:
HCF(a, b) × LCM(a, b) = a × b
2. Proofs of Irrationality (Using Contradiction)
√ √ √
The proofs for the irrationality of numbers like 2, 3, and 5 rely on a logical method called
**Proof by Contradiction**.
Theorem used in the Proof If p is a prime number and p divides a2 , then p divides a, where
a is a positive integer.
[Link] | Page 1
√
2.1. Proof that 2 is Irrational
√
1. Assumption (Contradiction): Assume, for the sake of contradiction, that 2 is a **ra-
tional number**.
√
2. Rational Form: If 2 is rational, it can be written as a fraction ab , where a and b are
co-prime integers (i.e., they have no common factor other than 1), and b 6= 0.
√ a
2=
b
3. Squaring and Rearranging: Squaring both sides gives:
a2
2=
b2
2b2 = a2 (Equation 1)
4. Deduction 1: Since a2 = 2b2 , a2 is divisible by 2. By the theorem, if 2 divides a2 , then **2
must divide a**.
5. Substitution: Since 2 divides a, we can write a = 2c for some integer c. Substituting this
into Equation 1:
2b2 = (2c)2
2b2 = 4c2
b2 = 2c2
6. Deduction 2: Since b2 = 2c2 , b2 is divisible by 2. By the theorem, if 2 divides b2 , then **2
must divide b**.
7. Contradiction: From Deduction 1 and Deduction 2, we find that both a and b have a
common factor of 2. This contradicts our initial assumption that a and b are co-prime
integers.
8. Conclusion:
√ Since our assumption led to a contradiction, the assumption must be false.
Hence, 2 is an **irrational number**.
√
2.2. Proof that 3 is Irrational
√
The proof follows the same structure as 2, replacing 2 with 3.
√
1. Assumption: Assume 3 = ab , where a and b are co-prime integers.
a2
2. Squaring: 3 = b2
=⇒ 3b2 = a2 .
3. Deduction 1: Since a2 is divisible by 3, **3 must divide a**. Let a = 3c.
4. Substitution: Substituting a = 3c into 3b2 = a2 :
3b2 = (3c)2
3b2 = 9c2
b2 = 3c2
5. Deduction 2: Since b2 is divisible by 3, **3 must divide b**.
6. Contradiction: a and b have a common factor of 3, which contradicts the assumption
that they are co-prime.
√
7. Conclusion: 3 is an **irrational number**.
2
√
2.3. Proof that 5 is Irrational
Again, the same method is used, replacing 2 with 5.
√
1. Assumption: Assume 5 = ab , where a and b are co-prime integers.
a2
2. Squaring: 5 = b2
=⇒ 5b2 = a2 .
3. Deduction 1: Since a2 is divisible by 5, **5 must divide a**. Let a = 5c.
4. Substitution: Substituting a = 5c into 5b2 = a2 :
5b2 = (5c)2
5b2 = 25c2
b2 = 5c2
5. Deduction 2: Since b2 is divisible by 5, **5 must divide b**.
6. Contradiction: a and b have a common factor of 5, which contradicts the assumption
that they are co-prime.
√
7. Conclusion: 5 is an **irrational number**.
3
Get Ahead in Your Studies!
Buy full notes, guess papers with
answers
Rs 119 per subject
Buy notes from [Link]
Connect with Us:
Platform Link
Telegram Channel [Link]
WhatsApp Channel [Link]
YouTube Channel [Link]
Our Website [Link]