Introduction to Real Numbers

Numbers form the foundation of mathematics and appear in countless real-world situations, from measuring distances to calculating money. Among all types of numbers, real numbers form the most comprehensive set that includes both rational and irrational numbers. Understanding real numbers is crucial for solving a wide range of problems in competitive exams and higher education.

In this chapter, we will explore the classification of real numbers, special types like prime and composite numbers, important properties such as factorization, and operations including finding the greatest common divisor (GCD) and least common multiple (LCM). We will also cover divisibility rules, the division algorithm, number bases, and modular arithmetic. Each concept will be explained from first principles with clear examples and visual aids to build a strong conceptual foundation.

Classification of Real Numbers

Real numbers include all the numbers that can be found on the number line. They can be broadly divided into two categories:

• Rational Numbers: Numbers that can be expressed as a fraction \(\frac{p}{q}\), where \(p\) and \(q\) are integers and \(q eq 0\).
• Irrational Numbers: Numbers that cannot be expressed as a simple fraction; their decimal expansions are non-terminating and non-repeating.

Before diving deeper, let's understand the subsets of rational numbers and how they relate to each other.

Definitions and Examples:

• Natural Numbers (ℕ): Counting numbers starting from 1, 2, 3, ...
  Example: Number of INR 10 coins in your pocket could be 3, 5, or 10.
• Whole Numbers: Natural numbers including zero: 0, 1, 2, 3, ...
  Example: Number of books on a shelf could be 0 (empty) or more.
• Integers (ℤ): Whole numbers along with their negative counterparts: ..., -3, -2, -1, 0, 1, 2, 3, ...
  Example: Temperature in °C can be -5, 0, or 25.
• Rational Numbers (ℚ): Numbers expressible as \(\frac{p}{q}\) where \(p, q \in \mathbb{Z}\), \(q eq 0\). Includes integers, fractions, and terminating or repeating decimals.
  Example: \(\frac{3}{4}\), 0.75, -2, 5.333... (which is \(\frac{16}{3}\))
• Irrational Numbers: Numbers that cannot be expressed as a fraction and have non-terminating, non-repeating decimals.
  Example: \(\sqrt{2} \approx 1.4142135...\), \(\pi \approx 3.1415926...\)

Prime and Composite Numbers

Among natural numbers, some have special significance:

• Prime Numbers: Natural numbers greater than 1 that have exactly two distinct positive divisors: 1 and the number itself.
• Composite Numbers: Natural numbers greater than 1 that have more than two positive divisors.

Understanding primes is essential because they are the building blocks of all natural numbers through multiplication.

Factorization and Prime Factorization

Factorization is the process of expressing a number as a product of its factors. For example, 12 can be factored as \(3 \times 4\) or \(2 \times 6\).

Prime factorization breaks a number down into prime numbers that multiply to give the original number. This is important for finding the GCD and LCM of numbers.

graph TD    A[Start with 84]    A --> B{Divide by smallest prime}    B -->|2| C[84 / 2 = 42]    C --> B    B -->|2| D[42 / 2 = 21]    D --> B    B -->|3| E[21 / 3 = 7]    E --> B    B -->|7| F[7 / 7 = 1]    F --> G[Stop: quotient is 1]

Thus, the prime factorization of 84 is:

84 = 2 x 2 x 3 x 7 = \(2^2 \times 3 \times 7\)

Greatest Common Divisor (GCD) and Least Common Multiple (LCM)

The Greatest Common Divisor (GCD) of two numbers is the largest number that divides both of them without leaving a remainder.

The Least Common Multiple (LCM) of two numbers is the smallest number that is a multiple of both.

Using prime factorization, we can find GCD and LCM efficiently.

To find the GCD, take the minimum exponent of each prime:

\(\mathrm{GCD} = 2^{\min(2,1)} \times 3^{\min(1,2)} \times 7^{\min(1,1)} = 2^1 \times 3^1 \times 7^1 = 42\)

To find the LCM, take the maximum exponent of each prime:

\(\mathrm{LCM} = 2^{\max(2,1)} \times 3^{\max(1,2)} \times 7^{\max(1,1)} = 2^2 \times 3^2 \times 7^1 = 252\)

Divisibility Rules

Divisibility rules help quickly determine if one number divides another without performing full division. Here are some common rules:

• Divisible by 2: Last digit is even (0, 2, 4, 6, 8).
• Divisible by 3: Sum of digits is divisible by 3.
• Divisible by 4: Last two digits form a number divisible by 4.
• Divisible by 5: Last digit is 0 or 5.
• Divisible by 6: Number is divisible by both 2 and 3.
• Divisible by 7: Double the last digit and subtract it from the rest of the number; if result is divisible by 7, so is the original number.
• Divisible by 8: Last three digits form a number divisible by 8.
• Divisible by 9: Sum of digits is divisible by 9.
• Divisible by 10: Last digit is 0.
• Divisible by 11: Difference between sum of digits in odd and even positions is divisible by 11.
• Divisible by 12: Number is divisible by both 3 and 4.

Remainder Theorem and Division Algorithm

The division algorithm states that for any integers \(a\) (dividend) and \(b\) (divisor, \(b eq 0\)), there exist unique integers \(q\) (quotient) and \(r\) (remainder) such that:

\[ a = bq + r, \quad 0 \leq r < |b| \]

This means when you divide \(a\) by \(b\), you get a quotient \(q\) and a remainder \(r\) which is always less than the divisor.

graph TD    A[Start with dividend a and divisor b]    A --> B[Divide a by b]    B --> C[Find quotient q]    C --> D[Calculate remainder r = a - bq]    D --> E{Is 0 ≤ r < |b|?}    E -->|Yes| F[Stop: division complete]    E -->|No| G[Adjust q and r]    G --> F

The Remainder Theorem is a useful tool in algebra. It states that the remainder when a polynomial \(f(x)\) is divided by \((x - c)\) is equal to \(f(c)\).

Number Bases and Base Conversion

While we commonly use the decimal system (base 10), other bases like binary (base 2), octal (base 8), and hexadecimal (base 16) are important in computer science and digital electronics.

Each base uses digits from 0 up to one less than the base. For example, binary digits are 0 and 1; octal digits are 0 to 7; hexadecimal digits are 0 to 9 and A to F (where A=10, B=11, ..., F=15).

Arithmetic in Different Bases

Arithmetic operations like addition, subtraction, multiplication, and division can be performed in any base. The key is to apply the same principles as in base 10 but carry over or borrow when digits exceed the base.

For example, in base 8 (octal), digits range from 0 to 7. If a sum exceeds 7, carry over to the next digit.

Modular Arithmetic and Congruence

Modular arithmetic deals with integers wrapped around after reaching a certain value called the modulus. It is like the arithmetic of a clock, where after 12 hours, the count resets to 1.

We say two integers \(a\) and \(b\) are congruent modulo \(m\) if their difference is divisible by \(m\), written as:

\[ a \equiv b \pmod{m} \iff m \mid (a - b) \]

For example, \(17 \equiv 5 \pmod{12}\) because \(17 - 5 = 12\) is divisible by 12.

Worked Examples