Number system — real numbers
वास्तविक संख्याएँ I — यूक्लिड विभाजन और अभाज्य छाप
What BSEB puts in this chapter
> Number system — real numbers.
The syllabus gives this chapter one line. Behind it sits everything a teacher of classes 9–10 needs on whole and real numbers: Euclid's division lemma, the Fundamental Theorem of Arithmetic, irrational numbers and decimal expansions. This topic takes the integers; the next takes the irrationals and the decimals.
The pin for this topic: EVERY NUMBER ABOVE 1 HAS EXACTLY ONE PRIME FINGERPRINT. Write a number as a product of primes and you can read off its HCF and LCM with any other number, decide what it is divisible by, and say whether a fraction with it as denominator will terminate. One factorisation answers all four kinds of question.
वास्तविक संख्याएँ I — यूक्लिड विभाजन और अभाज्य छाप
Division first, then factorisation
Euclid's division lemma. Given positive integers a and b, there are unique integers q and r with a = bq + r, 0 ≤ r < b. It is the long division you already do, stated exactly: the remainder is never negative and always smaller than the divisor.
Euclid's division algorithm, for the HCF. Divide the larger number by the smaller. If the remainder is not 0, divide the old divisor by the remainder. Repeat. When the remainder becomes 0, the last divisor is the HCF. It works because the HCF of a and b equals the HCF of b and r at every step.
The Fundamental Theorem of Arithmetic. Every composite number can be written as a product of primes, and this factorisation is unique apart from the order of the factors. 1 is neither prime nor composite; 2 is the only even prime.
Reading HCF and LCM off the factorisation.
The lemma also sorts numbers into forms. On division by b the remainder can only be 0, 1, …, b − 1. So every integer is 2q or 2q + 1; every odd integer is 4q + 1 or 4q + 3; and the square of any integer is 3m or 3m + 1, never 3m + 2.
वास्तविक संख्याएँ I — यूक्लिड विभाजन और अभाज्य छाप
Worked through
1. The HCF by Euclid's algorithm. The HCF of 867 and 255.
867 = 255 × 3 + 102
255 = 102 × 2 + 51
102 = 51 × 2 + 0
The remainder is 0, so the HCF is the last divisor, 51. Check by primes: 867 = 3 × 17² and 255 = 3 × 5 × 17; the common part is 3 × 17 = 51.
2. Three numbers by primes. 12 = 2² × 3, 15 = 3 × 5, 21 = 3 × 7. HCF = 3, the only common prime. LCM = 2² × 3 × 5 × 7 = 420.
3. The LCM from the HCF. The HCF of 306 and 657 is 9. LCM = 306 × 657 ÷ 9 = 306 × 73 = 22,338.
4. A remainder problem. The largest number that divides 70 and 125 leaving remainders 5 and 8. Take the remainders off: 70 − 5 = 65 and 125 − 8 = 117. The HCF of 65 and 117 is 13, since 65 = 5 × 13 and 117 = 9 × 13.
5. Can 4ⁿ end in 0? A number ending in 0 has both 2 and 5 among its prime factors. 4ⁿ = 2²ⁿ has only the prime 2, and because the factorisation is unique no 5 can ever appear. So never.
6. Squares are 3m or 3m + 1. Any integer is 3q, 3q + 1 or 3q + 2. Squaring: 9q² = 3(3q²); 9q² + 6q + 1 = 3(3q² + 2q) + 1; 9q² + 12q + 4 = 3(3q² + 4q + 1) + 1. No square leaves remainder 2 on division by 3.
वास्तविक संख्याएँ I — यूक्लिड विभाजन और अभाज्य छाप
Commonly said, and wrong
"1 is a prime number." A prime has exactly two different factors, 1 and itself. 1 has only one factor, so it is neither prime nor composite, and the Fundamental Theorem needs it left out: otherwise 6 = 2 × 3 = 1 × 2 × 3 would break uniqueness.
"2 cannot be prime, because it is even." 2 has exactly two factors, 1 and 2. It is the only even prime.
"The lemma and the algorithm are the same thing." The lemma is a statement: a = bq + r with 0 ≤ r < b. The algorithm is the procedure of applying it again and again, until the remainder is 0, to find an HCF.
"HCF × LCM = product works for any set of numbers." Only for two. For 6, 10 and 15: HCF 1 × LCM 30 = 30, but the product is 900.
"In a = bq + r, the remainder may be as large as the divisor." If r were b, the divisor would go in once more. The condition is strictly r < b.
वास्तविक संख्याएँ I — यूक्लिड विभाजन और अभाज्य छाप
Points to Remember
The pin. Every number above 1 has exactly one prime fingerprint.
Lemma: a = bq + r, 0 ≤ r < b, with q and r unique.
Algorithm: divide, then divide the divisor by the remainder; when the remainder reaches 0, the last divisor is the HCF.
Fundamental Theorem: every composite number is a product of primes, unique apart from order · 1 is not prime · 2 is the only even prime.
HCF = smallest powers of the common primes · LCM = greatest powers of all the primes · two numbers only: HCF × LCM = product.
Remainder problems: subtract the remainders first, then take the HCF.
Ends in 0 only if both 2 and 5 are prime factors, so 4ⁿ, 6ⁿ and 9ⁿ never end in 0.
वास्तविक संख्याएँ II — अपरिमेय संख्याएँ, और रुकने या दोहराने वाले दशमलव
What BSEB puts in this chapter
> Number system — real numbers.
The second half of the chapter: which numbers are rational and which are not, how to prove a square root irrational, what a fraction's decimal will look like before you divide, and the working rules for surds and exponents.
The pin for this topic: LOOK AT THE DENOMINATOR IN LOWEST TERMS, NOT AT THE DECIMAL. Whether p/q stops, repeats, or does neither is decided by the prime fingerprint of q, the idea of the previous topic, once the fraction is reduced. Dividing out twenty places to look for a pattern is slower, and it can mislead.
वास्तविक संख्याएँ II — अपरिमेय संख्याएँ, और रुकने या दोहराने वाले दशमलव
Rational, irrational, real
Rational: can be written p/q with p and q integers and q ≠ 0. Irrational: cannot. √2, √3, √5, π and 0.101001000… are irrational. Rationals and irrationals together make the real numbers, and every real number is exactly one point on the number line.
Decimal expansions.
| Number | Its decimal |
|---|---|
| rational | terminating, or non-terminating recurring |
| irrational | non-terminating non-recurring |
The terminating test. Reduce p/q to lowest terms. It terminates exactly when q = 2ᵐ × 5ⁿ with no other prime, and it then ends after the larger of m and n places. Any other prime in q gives a recurring decimal.
Proving √p irrational, for a prime p. The key fact: if a prime p divides a², it divides a. Suppose √p = a/b with a and b sharing no factor. Then pb² = a², so p divides a; write a = pc, and pb² = p²c² gives b² = pc², so p divides b too. Both divisible by p contradicts "no common factor".
Combining. rational + irrational = irrational · non-zero rational × irrational = irrational · but two irrationals can give a rational: (2 + √3) + (2 − √3) = 4, and √2 × √2 = 2.
Surds and exponents. To rationalise 1/(√a + √b), multiply above and below by √a − √b. For a > 0: aᵐ × aⁿ = aᵐ⁺ⁿ · (aᵐ)ⁿ = aᵐⁿ · a^(1/n) is the nth root of a · a^(m/n) = (nth root of a)ᵐ.
वास्तविक संख्याएँ II — अपरिमेय संख्याएँ, और रुकने या दोहराने वाले दशमलव
Worked through
1. Terminates, and where. 13/3125: 3125 = 5⁵, only 5s, so it terminates after 5 places. 13/5⁵ = 13 × 2⁵/10⁵ = 416/100000 = 0.00416.
2. Reduce first. 6/15: 15 = 3 × 5 holds a 3, but in lowest terms 6/15 = 2/5, so it terminates: 0.4.
3. Recurs. 64/455: 455 = 5 × 7 × 13, and 64/455 is already in lowest terms. The 7 and the 13 make it non-terminating recurring.
4. A recurring decimal as a fraction. x = 0.4747…. Then 100x = 47.4747…. Subtract: 99x = 47, so x = 47/99. One repeating digit, multiply by 10; two, by 100.
5. Rationalise. 1/(√7 − √2) = (√7 + √2)/((√7)² − (√2)²) = (√7 + √2)/5.
6. Exponents. 64^(2/3) = (cube root of 64)² = 4² = 16. And 2^(1/2) × 2^(1/3) = 2^(5/6), because the powers add.
वास्तविक संख्याएँ II — अपरिमेय संख्याएँ, और रुकने या दोहराने वाले दशमलव
Commonly said, and wrong
"π = 22/7." 22/7 is rational: 3.142857142857…, recurring. π is irrational, 3.14159…; 22/7 is only a convenient approximation for calculation.
"6/15 cannot terminate, because 15 holds the prime 3." The test applies to the fraction in lowest terms. 6/15 = 2/5 = 0.4.
"Every non-terminating decimal is irrational." 0.333… = 1/3 never ends, but it repeats, so it is rational. Irrational needs non-terminating and non-recurring.
"The sum of two irrationals is always irrational." (2 + √3) + (2 − √3) = 4. A product can be rational too: √2 × √8 = 4.
"Every square root is irrational." √4 = 2 and √(9/16) = 3/4. For a natural number n, √n is irrational exactly when n is not a perfect square.
वास्तविक संख्याएँ II — अपरिमेय संख्याएँ, और रुकने या दोहराने वाले दशमलव
Points to Remember
The pin. Look at the denominator in lowest terms, not at the decimal.
Rational: p/q, q ≠ 0, so terminating or recurring · irrational: non-terminating and non-recurring · together the real numbers, one point each on the number line.
Terminates exactly when q in lowest terms is 2ᵐ × 5ⁿ · it ends after the larger of m and n places.
Recurring to fraction: one repeating digit, ×10; two, ×100; then subtract · 0.4747… = 47/99.
√p is irrational for a prime p: p divides a² means p divides a, which leads to the contradiction.
Two irrationals can sum or multiply to a rational · π is irrational, and 22/7 is not π.
Rationalise 1/(√a + √b) with √a − √b · a^(m/n) = (nth root of a)ᵐ.