Definition: The number system is the fundamental framework of quantitative aptitude, categorizing numbers based on their properties, divisibility, and structural relationships. It forms the backbone of logical reasoning in competitive exams, focusing on identifying patterns, prime characteristics, and numerical sequences rather than rote memorization.
Understanding Prime and Composite Numbers
In competitive examinations, distinguishing between prime and composite numbers is a foundational skill. A prime number is a natural number greater than 1 that possesses exactly two distinct factors: 1 and itself. These numbers are the “building blocks” of all integers, as every composite number can be broken down into a unique product of primes.
Conversely, a composite number has more than two factors. It is critical to note that the number 1 is neither prime nor composite; it is a unique unit. Furthermore, 2 is the only even prime number. All other prime numbers are odd, as any even number greater than 2 would inherently be divisible by 2, thus failing the definition of a prime.
“A prime number greater than 3 can always be expressed in the form of 6n ± 1, where n is a natural number. While this is a helpful heuristic, remember that the converse is not always true—not every number in this form is guaranteed to be prime.”
The Root Algorithm for Prime Testing
When you encounter a large number in an exam and need to determine if it is prime, do not attempt to guess. Instead, use the Root Algorithm. This systematic approach saves time and reduces errors during high-pressure testing environments.
- Identify the given number, let us call it n.
- Find the approximate square root of n. If it is not a perfect square, round it up to the next natural number.
- List all prime numbers that are less than or equal to this square root value.
- Divide the original number n by each of these prime numbers sequentially.
- If n is not divisible by any of these primes, it is confirmed to be a prime number.
Arithmetic Properties of Even and Odd Numbers
Understanding the parity of numbers is essential for solving complex logical puzzles in the CSAT. An even number is defined as any integer of the form 2n, while an odd number takes the form 2n ± 1. Notably, 0 is considered an even number, a fact often tested in UPSC papers to catch students off guard.
Mastering these basic interactions is vital for quick mental math:
- Even + Even = Even
- Even + Odd = Odd
- Odd + Odd = Even
These rules are particularly useful when a question asks for the sum of three prime numbers equaling an even total. Since the sum is even, you can logically deduce that at least one of the primes must be 2 (the only even prime), which drastically narrows down the search space for your variables.
Summation Formulas for Sequences
Competitive exams frequently test your ability to calculate sums of series. Rather than adding terms individually, use these standard algebraic identities to find the result efficiently:
| Series Type | Formula |
|---|---|
| Sum of first n natural numbers | n(n+1) / 2 |
| Sum of squares of first n numbers | n(n+1)(2n+1) / 6 |
| Sum of cubes of first n numbers | [n(n+1) / 2]² |
| Sum of first n odd numbers | n² |
Properties of Interchanged Digits
A common question type in UPSC and SSC exams involves the manipulation of two-digit numbers. If you have a number represented as xy (which is 10x + y), and you interchange the digits to form yx (10y + x), specific mathematical properties emerge.
The difference between these two numbers is always a multiple of 9, specifically 9|x – y|. Similarly, the sum of these two numbers is always a multiple of 11, expressed as 11(x + y). Recognizing these relationships allows you to solve “digit problem” questions in seconds without needing to form complex algebraic equations.
Key Points to Remember
- 1 is neither prime nor composite.
- 2 is the only even prime number; it is also the smallest prime.
- There are exactly 25 prime numbers between 1 and 100.
- Co-prime numbers are pairs of numbers whose Highest Common Factor (HCF) is 1.
- When the sum of three primes is even, one of them must be 2.
- The square root algorithm is the most reliable way to test for primality of numbers under 400.
- Always check if a sequence follows a pattern related to the sum of natural numbers (e.g., triangular numbers).
Quick Revision Summary
- Prime numbers have exactly two factors: 1 and themselves.
- Use 6n ± 1 to identify potential primes, but verify with the root algorithm.
- Parity (even/odd) rules help solve sum-based logic questions quickly.
- Memorize the summation formulas for n, n², and n³ for sequence problems.
- The difference between a 2-digit number and its reverse is always a multiple of 9.
- The sum of a 2-digit number and its reverse is always a multiple of 11.
- 0 is an even number.
- Practice identifying the “last term” of rows in structured number patterns.
