Numbers are the foundation of mathematics, and the way we represent numbers depends on the number base or radix. The base of a number system tells us how many unique digits, including zero, are used to represent numbers. For example, the familiar decimal system uses base 10, meaning digits range from 0 to 9.
But why do we use different bases? Different bases have practical applications in computing, digital electronics, and coding theory. For instance, computers use binary (base 2) because their circuitry has two states: ON and OFF. Octal (base 8) and hexadecimal (base 16) are compact ways to represent binary numbers more efficiently.
Understanding arithmetic in different bases is crucial for competitive exams, especially in sections involving number systems and logical reasoning. This chapter will guide you through how numbers are represented in various bases and how to perform arithmetic operations like addition, subtraction, multiplication, and division in these systems.
Every number system is defined by its base b. In base b, digits range from 0 to b - 1. Each digit's position represents a power of the base, starting from the rightmost digit (least significant digit) at power 0.
For example, the number \( 243 \) in base 10 (decimal) means:
\[2 \times 10^2 + 4 \times 10^1 + 3 \times 10^0 = 200 + 40 + 3 = 243\]This positional value concept applies to all bases.
| Digit Position | Base 2 (Binary) | Base 8 (Octal) | Base 10 (Decimal) | Base 16 (Hexadecimal) |
|---|---|---|---|---|
| 3 (leftmost) | \( 2^3 = 8 \) | \( 8^3 = 512 \) | \( 10^3 = 1000 \) | \( 16^3 = 4096 \) |
| 2 | \( 2^2 = 4 \) | \( 8^2 = 64 \) | \( 10^2 = 100 \) | \( 16^2 = 256 \) |
| 1 | \( 2^1 = 2 \) | \( 8^1 = 8 \) | \( 10^1 = 10 \) | \( 16^1 = 16 \) |
| 0 (rightmost) | \( 2^0 = 1 \) | \( 8^0 = 1 \) | \( 10^0 = 1 \) | \( 16^0 = 1 \) |
Note that in hexadecimal, digits go beyond 9 and include letters A to F representing 10 to 15.
Converting numbers between bases is essential to understand arithmetic in different bases. Two main methods are used:
graph TD A[Start: Number in base b] --> B[Expand using positional values] B --> C[Calculate sum to get decimal number] C --> D[Decimal number obtained] E[Start: Decimal number] --> F[Divide by base b] F --> G[Record remainder] G --> H[Divide quotient by base b again] H --> I{Quotient = 0?} I -- No --> F I -- Yes --> J[Read remainders in reverse order] J --> K[Number in base b obtained]This flowchart shows the two-way conversion process clearly.
Arithmetic operations in different bases follow similar rules as decimal arithmetic but with adjustments for the base.
When adding two digits, if the sum equals or exceeds the base, a carry is generated to the next higher place value. For example, in base 8 (octal), digits range from 0 to 7. If the sum of two digits is 8 or more, subtract 8 and carry 1 to the next digit.
Subtraction in base \(b\) requires borrowing when the digit being subtracted is larger than the digit it is subtracted from. Borrowing reduces the next higher digit by 1 and adds \(b\) to the current digit.
Multiplication and division follow the same principles as decimal arithmetic but require knowledge of multiplication tables in the given base.
Memorizing multiplication tables for bases like 2, 8, and 16 helps speed up calculations.
Modular arithmetic involves working with remainders after division by a fixed number called the modulus. It is denoted as:
\[a \equiv b \pmod{m}\]This means \(a\) and \(b\) leave the same remainder when divided by \(m\).
Modular arithmetic is widely used in number theory and competitive exams for solving congruences, cryptography, and simplifying large calculations.
graph TD A[Start with numbers a, b and modulus m] --> B[Calculate a mod m] B --> C[Calculate b mod m] C --> D[Perform operation (add, subtract, multiply)] D --> E[Take result mod m] E --> F[Final result modulo m]
Step 1: Write digits and add from right to left.
Digits: \(2A3\) and \(1F4\)
Rightmost digit: \(3 + 4 = 7\) (less than 16, no carry)
Next digit: \(A_{16} = 10\), \(F_{16} = 15\), sum \(10 + 15 = 25\)
Since \(25 \geq 16\), subtract 16: \(25 - 16 = 9\), carry 1 to next digit.
Leftmost digit: \(2 + 1 + 1 (carry) = 4\)
Answer: \(497_{16}\)
Step 1: Identify place values from right to left:
| Digit | 1 | 1 | 0 | 1 |
|---|---|---|---|---|
| Place Value | \(2^3=8\) | \(2^2=4\) | \(2^1=2\) | \(2^0=1\) |
| Calculation | 1 x 8 = 8 | 1 x 4 = 4 | 0 x 2 = 0 | 1 x 1 = 1 |
Step 2: Sum all values: \(8 + 4 + 0 + 1 = 13\)
Answer: \(1101_2 = 13_{10}\)
Step 1: Write numbers aligned by place value:
7 2 5
- 3 4 6
Step 2: Subtract units place: \(5 - 6\) is not possible, borrow 1 from tens place.
Borrowing 1 in base 8 adds 8 to units place: \(5 + 8 = 13\)
Units place subtraction: \(13 - 6 = 7\)
Tens place after borrowing: \(2 - 1 = 1\)
Subtract tens place: \(1 - 4\) not possible, borrow 1 from hundreds place.
Borrowing 1 adds 8 to tens place: \(1 + 8 = 9\)
Tens place subtraction: \(9 - 4 = 5\)
Hundreds place after borrowing: \(7 - 1 = 6\)
Subtract hundreds place: \(6 - 3 = 3\)
Answer: \(357_8\)
Step 1: Write the multiplicand and multiplier:
Multiplicand: 1011 (decimal 11)
Multiplier: 110 (decimal 6)
Step 2: Multiply each digit of multiplier by multiplicand, shifting left for each digit:
Step 3: Add partial products:
0 + 10110 + 101100
Adding:
000000 +010110 +101100 -------- 111010
Answer: \(111010_2\) (decimal 66)
Step 1: Find the modular inverse of 7 modulo 11.
We want \(7 \times y \equiv 1 \pmod{11}\).
Check multiples of 7 mod 11:
So, the modular inverse of 7 mod 11 is 8.
Step 2: Multiply both sides of original congruence by 8:
\[ 8 \times 7x \equiv 8 \times 3 \pmod{11} \] \[ (8 \times 7) x \equiv 24 \pmod{11} \] \[ 1 \times x \equiv 24 \pmod{11} \] \[ x \equiv 24 \pmod{11} \]Since \(24 \mod 11 = 2\),
Answer: \(x \equiv 2 \pmod{11}\)
When to use: To speed up multiplication and division in non-decimal bases during exams.
When to use: For quick and accurate base conversions without confusion.
When to use: When unsure about direct arithmetic in a base, convert, calculate, then convert back.
When to use: In problems involving large numbers or congruences in competitive exams.
When to use: To avoid invalid digit errors during arithmetic or conversion.
Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.
Go to practice →