CAT Number System and Theory

The number system and theory form the backbone of the CAT Quantitative Ability section, testing not just computational speed but deep conceptual clarity. These topics, such as divisibility and remainders, are rich in logic and often serve as key differentiators between average and high scorers. Mastering them requires moving beyond formulas to intuitive understanding, enabling you to tackle complex problems under time pressure.

Basic Number Properties and Divisibility

Every integer belongs to categories defined by its divisors. A prime number is a natural number greater than 1 that has exactly two distinct positive divisors: 1 and itself, like 2, 3, or 17. Conversely, a composite number has more than two distinct divisors, such as 4, 6, or 15. Recognizing primes and composites is foundational because they dictate how numbers break down in operations like factorization.

Divisibility rules allow you to quickly assess whether one number divides another without performing full division. For example, a number is divisible by 2 if its last digit is even, and by 3 if the sum of its digits is divisible by 3. For 5, check if the last digit is 0 or 5. A handy rule for 11: subtract the sum of digits in odd positions from the sum in even positions; if the result is 0 or divisible by 11, the number is too. Take 121: odd-position digits (first and third) sum to 1+1=2, even-position digit (second) is 2, difference is 0, so 121 is divisible by 11.

Apply these rules to save precious seconds. Consider 456: it's divisible by 2 (last digit 6) and 3 (sum 4+5+6=15, divisible by 3), but not by 5. Regular practice with such mental checks builds accuracy, preventing careless errors in the exam's stressful environment.

Number base systems are another key concept. Numbers can be represented in different bases, such as binary (base-2), decimal (base-10), or hexadecimal (base-16). Understanding base conversion and arithmetic in non-decimal systems is essential for certain CAT problems, often involving digits or place values.

Factors, Multiples, HCF, and LCM

Building on basic properties, we explore relationships between numbers. The factors of a number are integers that divide it exactly, while multiples are products of the number with any integer. For instance, factors of 18 are 1,2,3,6,9,18, and multiples include 18,36,54. This leads to HCF (Highest Common Factor), the largest number dividing two or more integers, and LCM (Least Common Multiple), the smallest positive integer divisible by all.

To find HCF and LCM, use prime factorization or the division method. For numbers 24 and 36, prime factors are 24=2³×3 and 36=2²×3². HCF takes the lowest powers of common primes: 2²×3=12. LCM takes the highest powers of all primes: 2³×3²=72. In CAT problems, discerning between HCF and LCM is crucial. For example, if you need the largest tile to squarely cover rectangular floors of dimensions 24m and 36m, you want the HCF of 24 and 36, which is 12m. Conversely, if two lights blink every 24 and 36 seconds, the time they blink together is the LCM, 72 seconds.

Work through a typical question: Find the greatest number that divides 48, 96, and 144 without leaving a remainder. Here, you compute HCF: 48=2⁴×3, 96=2⁵×3, 144=2⁴×3², so HCF=2⁴×3=16×3=48. This step-by-step approach ensures you don't miss common factors.

Remainders and Modular Arithmetic

When division isn't exact, remainders become central. The remainder theorem formalizes this: for integers $a$ and $d$ (with $d>0$), there exist unique integers $q$ (quotient) and $r$ (remainder) such that $a=dq+r$ where $0\le r<d$. This theorem is the basis for modular arithmetic, where we work with remainders modulo a number. For example, in modulo 5, $12\equiv 2(\mathrm{mod}5)$ because 12 divided by 5 leaves a remainder of 2.

Key theorems in modular arithmetic include Euler's theorem: for coprime integers $a$ and $n$, $a^{\varphi (n)}\equiv 1(\mathrm{mod}n)$, where $\varphi (n)$ is Euler's totient function counting positive integers up to $n$ that are coprime to $n$. A special case is Fermat's little theorem: for a prime $p$ and integer $a$ not divisible by $p$, $a^{p-1}\equiv 1(\mathrm{mod}p)$. These theorems simplify large exponent calculations common in CAT problems.

Common Pitfalls

A common mistake is confusing HCF and LCM in word problems; remember that HCF relates to division or partitioning, while LCM relates to repetition or synchronization. Another pitfall is misapplying divisibility rules, such as for 11, where the digit positions must be correctly identified. Overlooking base system conversions can lead to errors in digit-based questions. Always double-check prime factorizations for accuracy.

Summary

• Master divisibility rules for quick mental checks on numbers like 2, 3, 5, and 11.
• Understand factors, multiples, HCF, and LCM through prime factorization for solving real-world problems.
• Apply the remainder theorem and modular arithmetic, including Euler's and Fermat's theorems, for efficient calculations.
• Recognize prime and composite numbers and their properties in factorization.
• Be proficient with number base systems for conversions and arithmetic.
• Avoid common pitfalls by carefully distinguishing between HCF and LCM and verifying divisibility rules.