Login
OR
Don't worry. We'll fix this for you!
Integers form a fundamental part of the number system. They include all whole numbers and their negatives, as well as zero. In simple terms, integers are numbers without fractional or decimal parts. For example, -5, 0, and 12 are all integers.
Integers are essential in everyday life - from measuring temperature below zero degrees Celsius to calculating profits and losses in INR. In competitive exams, a strong grasp of integers and their properties is crucial for solving problems quickly and accurately.
Understanding integers also lays the foundation for deeper topics in number theory, such as divisibility, prime numbers, and modular arithmetic.
What are Integers? Integers are the set of numbers that include all positive whole numbers, zero, and negative whole numbers. Symbolically, integers are represented as:
\( \ldots, -3, -2, -1, 0, 1, 2, 3, \ldots \)
Here, the dots indicate that the sequence continues infinitely in both directions.
Key Properties of Integers relate to how they behave under basic operations:
These properties ensure that integers form a well-structured system for arithmetic operations.
Positive integers are numbers greater than zero (1, 2, 3, ...), often used to count objects. Negative integers are less than zero (-1, -2, -3, ...), representing losses, debts, or temperatures below zero.
Zero (0) is neither positive nor negative but plays a crucial role as the neutral element in addition.
Integers can be classified as even or odd based on divisibility by 2.
Understanding even and odd numbers helps in solving many problems involving parity and divisibility.
| Operation | Even ± Even | Odd ± Odd | Even ± Odd | Even x Even | Odd x Odd | Even x Odd |
|---|---|---|---|---|---|---|
| Result | Even | Even | Odd | Even | Odd | Even |
Example: Sum of two odd numbers like 3 and 5 is 8 (even). Product of an even and an odd number like 4 and 7 is 28 (even).
The Division Algorithm is a fundamental concept that expresses any integer division in terms of quotient and remainder.
For any two 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 absolute value of \(b\).
graph TD A[Start with integers a and b (b ≠ 0)] B[Divide a by b] C[Find quotient q = floor(a/b)] D[Calculate remainder r = a - bq] E[Check if 0 ≤ r < |b|] F[Output q and r] A --> B B --> C C --> D D --> E E -->|Yes| F E -->|No| B
The Remainder Theorem extends this idea to polynomials, stating that the remainder when a polynomial \(f(x)\) is divided by \((x - c)\) is \(f(c)\). This theorem is useful in modular arithmetic and polynomial factorization.
Prime Numbers are integers greater than 1 that have no positive divisors other than 1 and themselves. Examples: 2, 3, 5, 7, 11.
Composite Numbers are integers greater than 1 that have more than two positive divisors. Examples: 4, 6, 8, 9, 12.
Prime numbers are the building blocks of integers since every integer greater than 1 can be uniquely factorized into primes.
| Prime Numbers | Composite Numbers |
|---|---|
| 2 | 4 |
| 3 | 6 |
| 5 | 8 |
| 7 | 9 |
| 11 | 10 |
| 13 | 12 |
| 17 | 14 |
| 19 | 15 |
| 23 | 16 |
| 29 | 18 |
Greatest Common Divisor (GCD) of two integers is the largest integer that divides both numbers without leaving a remainder.
Least Common Multiple (LCM) of two integers is the smallest positive integer that is divisible by both numbers.
There are two common methods to find GCD and LCM:
graph TD A[Start with numbers a and b] B[Check if b = 0] C[If yes, GCD = a] D[If no, replace a by b and b by a mod b] E[Repeat until b = 0] A --> B B -->|Yes| C B -->|No| D D --> E E --> B
Once GCD is found, LCM can be calculated using the relation:
\[ \gcd(a,b) \times \mathrm{lcm}(a,b) = a \times b \]
Modular arithmetic deals with integers wrapped around a fixed modulus \(n\). It is like working with a clock where numbers reset after reaching \(n\).
Two integers \(a\) and \(b\) are said to be congruent modulo \(n\) if their difference is divisible by \(n\). This is written as:
\[ a \equiv b \pmod{n} \iff n \mid (a - b) \]
For example, \(17 \equiv 5 \pmod{12}\) because \(17 - 5 = 12\), which is divisible by 12.
While we usually use the decimal system (base 10), numbers can be represented in other bases such as binary (base 2), octal (base 8), and hexadecimal (base 16). These are especially important in computer science and digital electronics.
Base 10 (Decimal): Uses digits 0-9.
Base 2 (Binary): Uses digits 0 and 1.
Base 8 (Octal): Uses digits 0-7.
Base 16 (Hexadecimal): Uses digits 0-9 and letters A-F (where A=10, B=11, ..., F=15).
| Decimal | Binary | Octal | Hexadecimal |
|---|---|---|---|
| 10 | 1010 | 12 | A |
| 15 | 1111 | 17 | F |
| 255 | 11111111 | 377 | FF |
| 100 | 1100100 | 144 | 64 |
Conversion between bases involves dividing or multiplying by the base and tracking remainders or digits carefully.
Step 1: Prime Factorization
48 = \(2^4 \times 3^1\) (since 48 = 2 x 2 x 2 x 2 x 3)
180 = \(2^2 \times 3^2 \times 5^1\) (since 180 = 2 x 2 x 3 x 3 x 5)
Step 2: Find GCD using minimum powers of primes
\(\gcd(48, 180) = 2^{\min(4,2)} \times 3^{\min(1,2)} \times 5^{\min(0,1)} = 2^2 \times 3^1 \times 5^0 = 4 \times 3 \times 1 = 12\)
Step 3: Find LCM using maximum powers of primes
\(\mathrm{lcm}(48, 180) = 2^{\max(4,2)} \times 3^{\max(1,2)} \times 5^{\max(0,1)} = 2^4 \times 3^2 \times 5^1 = 16 \times 9 \times 5 = 720\)
Step 4: Verify using Euclid's Algorithm for GCD
Divide 180 by 48: \(180 = 48 \times 3 + 36\)
Divide 48 by 36: \(48 = 36 \times 1 + 12\)
Divide 36 by 12: \(36 = 12 \times 3 + 0\)
Since remainder is 0, GCD = 12 (matches prime factorization result).
Answer: GCD = 12, LCM = 720
Step 1: Divide 1234 by 23.
23 x 53 = 1219 (since 23 x 50 = 1150, 23 x 3 = 69, total 1150 + 69 = 1219)
23 x 54 = 1242 (too large)
Step 2: Quotient \(q = 53\)
Step 3: Remainder \(r = 1234 - 1219 = 15\)
Answer: Quotient = 53, Remainder = 15
Step 1: Convert to Binary
Divide 255 by 2 repeatedly and note remainders:
Reading remainders bottom to top: 11111111
Step 2: Convert to Hexadecimal
Divide 255 by 16:
Remainders: 15 (F), 15 (F)
Hexadecimal: FF
Answer: 255 in binary is 11111111 and in hexadecimal is FF.
Step 1: Use modular exponentiation and properties
Calculate powers of 7 modulo 13:
Step 2: Use cyclicity
Since \(7^{12} \equiv 1 \pmod{13}\), powers of 7 repeat every 12 steps modulo 13.
Step 3: Reduce exponent modulo 12
Calculate \(100 \mod 12\): \(100 = 12 \times 8 + 4\), remainder 4.
Step 4: Calculate \(7^{100} \equiv 7^4 \pmod{13}\)
From above, \(7^4 \equiv 9 \pmod{13}\).
Answer: The remainder when \(7^{100}\) is divided by 13 is 9.
Step 1: Represent odd integers
Let the two odd integers be \(2m + 1\) and \(2n + 1\), where \(m, n\) are integers.
Step 2: Add the two odd integers
\((2m + 1) + (2n + 1) = 2m + 2n + 2 = 2(m + n + 1)\)
Step 3: Analyze the sum
The sum is \(2 \times \text{(an integer)}\), which is divisible by 2, hence even.
Answer: The sum of two odd integers is always even.
When to use: When dealing with large numbers in GCD problems.
When to use: To quickly determine parity in integer problems.
When to use: When calculating large powers modulo \(n\).
When to use: When working with binary, octal, or hexadecimal arithmetic.
When to use: To solve problems involving GCD and LCM efficiently.
Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.
Go to practice →
Your Score
Your Rank
| Rank | Name | Score |
|---|
