Foundations of Arithmetic Cheat Sheet - AFCAT

Welcome to the ultimate LibreTexts-style study guide for the AFCAT Arithmetic Module. This comprehensive lesson summary covers fundamental number systems, field axioms, divisibility rules, Euclidean algorithm, GCD/LCM properties, and progression sequences specifically tailored for AFCAT aspirants. Practice over 1 Lakh+ PYQs on ExamBhai.com to master these core concepts.

1. AFCAT Exam Context & Chapter Weightage

In the Air Force Common Admission Test (AFCAT), the Numerical Ability section tests candidate speed and foundational accuracy. Arithmetic concepts form over 60% of the math syllabus. Understanding number sets, divisibility properties, and mathematical progressions is critical for tackling direct formulas and complex word problems alike.

Chapter Weightage: Expect 2 to 4 questions directly or indirectly grounded in real numbers, division algorithms, LCM/GCD relationships, and arithmetic series.

2. Introduction to Number Systems

Arithmetic begins with classifying numbers into structural, hierarchical sets that expand from simple counting concepts to continuous magnitudes:

• Natural Numbers (\(\mathbb{N}\)): \(\{1, 2, 3, \dots\}\) used primarily for counting objects.
• Whole Numbers (\(\mathbb{W}\)): \(\{0, 1, 2, 3, \dots\}\), including the additive identity zero.
• Integers (\(\mathbb{Z}\)): \(\{\dots, -2, -1, 0, 1, 2, \dots\}\), incorporating negative magnitudes.
• Rational Numbers (\(\mathbb{Q}\)): Numbers expressible in the fractional form \(\frac{p}{q}\) where \(p, q \in \mathbb{Z}\) and \(q eq 0\).
• Real Numbers (\(\mathbb{R}\)): The complete set of rational and irrational numbers residing continuously along the real number line.

3. Fundamental Operations & Axioms

Every arithmetic simplification relies on fundamental field axioms. Let \(a, b, c \in \mathbb{R}\). The primary field axioms governing addition and multiplication are summarized below:

Property	Addition	Multiplication
Commutativity	\(a + b = b + a\)	\(a \cdot b = b \cdot a\)
Associativity	\((a + b) + c = a + (b + c)\)	\((a \cdot b) \cdot c = a \cdot (b \cdot c)\)
Distributivity	\(a \cdot (b + c) = a \cdot b + a \cdot c\)
Identity	\(a + 0 = a\)	\(a \cdot 1 = a\)
Inverse	\(a + (-a) = 0\)	\(a \cdot a^{-1} = 1 \quad (a eq 0)\)

4. Divisibility, GCD, and LCM

Integral division relies on the division algorithm. For any two integers \(a\) and \(b\) (with \(b eq 0\)), there exist unique integers \(q\) (quotient) and \(r\) (remainder) such that:

\[a = bq + r, \quad 0 \le r < |b|\]

This principle forms the base of the Euclidean Algorithm for evaluating the Greatest Common Divisor (GCD). The identity linking GCD and Least Common Multiple (LCM) for any two positive integers \(a\) and \(b\) is given by:

\[\text{GCD}(a, b) \times \text{LCM}(a, b) = a \cdot b\]

5. Progressions: Arithmetic Progression (AP)

Sequences model structural growth across mathematics. An Arithmetic Progression (AP) is a sequence of numbers in which the difference between consecutive terms remains constant.

• General Term (\(n\)-th term): \(T_n = a + (n - 1)d\), where \(a\) is the first term and \(d\) is the common difference.
• Sum of First \(n\) Terms: \(S_n = \frac{n}{2} \bigl(2a + (n - 1)d\bigr) = \frac{n}{2}(a + l)\), where \(l\) is the last term.

6. PYQ Analysis & NTA Pattern Insights

Analyzing recent AFCAT examination trends reveals clear patterns regarding arithmetic evaluation:

• Direct Formula Application: Over 40% of number system questions test standard identities like \(\text{GCD} \times \text{LCM} = a \cdot b\) or finding remainders.
• Word Problems on Progressions: AP questions frequently ask for total distance, total savings, or series totals using \(S_n\).
• Speed & Accuracy: Mastery over structural rules (like distributive properties) aids rapid simplification of complex mental arithmetic.

7. Frequently Asked Questions (People Also Ask)