AFCAT Arithmetic Masterclass - Number Systems, Progressions & Modular Arithmetic Cheat Sheet

AFCAT Exam Context & Strategy

PYQ Analysis: In the Air Force Common Admission Test (AFCAT), Numerical Ability constitutes a critical scoring section. Over recent examination cycles, questions on fundamental arithmetic have evolved from basic computation to analytical problem-solving involving prime factorization, series summations, and remainder theorems.

NTA Pattern & Weightage: AFCAT arithmetic concepts typically contribute 3 to 5 direct questions per paper. Mastery of prime properties, Arithmetic Progressions (AP), Geometric Progressions (GP), and Modular Arithmetic provides a strong foundation for tackling complex numerical reasoning problems quickly during the timed test.

Chapter 1: Number Systems & Fundamental Arithmetic

Arithmetic forms the bedrock of all mathematical reasoning. In this unit, we explore foundational structures, divisibility properties, and formal integer definitions crucial for competitive examinations like AFCAT.

1.1 Prime and Composite Numbers

Understanding the distinction between prime and composite numbers is fundamental to prime factorization and divisibility analysis.

Chapter 2: The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic establishes that prime numbers are the basic building blocks of all positive integers greater than 1.

2.1 Unique Prime Factorization

Every integer \(n > 1\) can be represented uniquely as a product of prime powers, up to the order of the factors:

where \(p_1 < p_2 < \cdots < p_k\) are distinct primes and \(a_i \ge 1\) are positive integers.

Chapter 3: Progressions and Series (AP & GP)

Sequences and series questions appear frequently in AFCAT. The primary types tested are Arithmetic Progressions (AP) and Geometric Progressions (GP).

3.1 Arithmetic Progression (AP)

An Arithmetic Progression is a sequence in which each term after the first is obtained by adding a fixed constant \(d\) (the common difference) to the preceding term.

• General Term (\(n\)-th term): \(a_n = a_1 + (n - 1)d\)
• Sum of the first \(n\) terms (\(S_n\)): \[S_n = \frac{n}{2} \bigl[ 2a_1 + (n - 1)d \bigr] = \frac{n}{2}(a_1 + a_n)\]

3.2 Geometric Progression (GP)

A Geometric Progression is a sequence in which each term after the first is obtained by multiplying the preceding term by a non-zero constant \(r\) (the common ratio).

• General Term (\(n\)-th term): \(a_n = a_1 r^{n-1}\)
• Sum of the first \(n\) terms (\(S_n\)): \[S_n = \frac{a_1(1 - r^n)}{1 - r} \quad \text{for } r eq 1\]

Chapter 4: Divisibility & Modular Arithmetic

Modular arithmetic simplifies remainder calculations involving large exponents, a favorite concept in advanced AFCAT numerical ability problems.

4.1 Congruence Modulo \(m\)

For integers \(a, b\) and \(m\) (with \(m > 0\)), we say that \(a\) is congruent to \(b\) modulo \(m\), written as:

if and only if \(m\) divides the difference \(a - b\) (i.e., \(m \mid (a - b)\)).

4.2 Worked Example: Modular Exponentiation

Example Question: Find the remainder when \(3^{100}\) is divided by \(7\).

Solution Step-by-Step:

1. By Fermat's Little Theorem, since \(7\) is prime and \(\gcd(3,7) = 1\): \[3^6 \equiv 1 \pmod 7\]
2. Break down the exponent \(100\) in terms of multiples of \(6\): \[100 = 6 \times 16 + 4\]
3. Apply modular properties: \[3^{100} \equiv (3^6)^{16} \times 3^4 \equiv 1^{16} \times 81 \equiv 81 \pmod 7\]
4. Compute \(81 \pmod 7\): \[81 = 7 \times 11 + 4 \implies 81 \equiv 4 \pmod 7\]

Thus, the remainder is 4.

Frequently Asked Questions (People Also Ask)