📚 Advanced Quantitative Aptitude – Tables
MIT‑level treatment for the Manipur Patwari / Lekhpal exam
Tables are the backbone of quantitative reasoning: they encode patterns, relationships, and hidden regularities that test‑takers must decode under time pressure. A solid grasp of the underlying mathematics—arithmetics, algebra, combinatorics, and linear algebra—turns every table into a solvable puzzle.
1. Foundations
| Concept | Definition | Key Formula | Why it matters in tables |
|---|---|---|---|
| Arithmetic Sequence (AP) | Numbers with a constant difference (d). | (a_n = a_1 + (n-1)d) | Many “number tables” are simple APs (e.g., fiscal year tables). |
| Geometric Sequence (GP) | Numbers with a constant ratio (r). | (a_n = a_1 r^{,n-1}) | Multiplication tables, compound‑interest tables. |
| Recurrence Relation | (a_n = f(a_{n-1},a_{n-2},\dots)) | e.g. Fibonacci (a_n=a_{n-1}+a_{n-2}) | Tables that combine two previous rows/columns. |
| Matrix Representation | Arranging numbers in an (m\times n) array. | (A = [a_{ij}]) | Enables linear‑algebraic manipulation (e.g., row‑/column‑operations to detect patterns). |
| Generating Function | Power series encoding a sequence. | (G(x)=\sum_{n\ge0} a_n x^n) | Provides closed‑form formulas for complex tables. |
| Modular Arithmetic | Computation modulo (m). | (a\bmod m) | Useful for cyclic tables (e.g., calendar tables). |
First Principle Insight
Every table is a finite representation of a sequence (row‑wise or column‑wise) or a bivariate sequence (two indices). By treating a table as a discrete function (T(i,j)), we can apply calculus‑like tools: differences, ratios, and recurrences.
2. Common Table Patterns & Theoretical Backbones
| Pattern | Theoretical Tool | Typical Exam Question |
|---|---|---|
| Linear Row/Column | AP | “Fill the missing number in the 3rd row, 5th column.” |
| Multiplication / Power Table | GP | “What is the 5th element of the 4th row?” |
| Alternating Sign/Parity | Modulo 2 | “Locate the cell that is odd.” |
| Diagonal Sums | Summation of AP | “Find the sum of the main diagonal.” |
| Cross‑Product Tables | Combinatorics | “Count numbers that are multiples of 3 in a 7×7 table.” |
| Cyclic Rotations | Modulo (n) | “Rotate the table by 90° and find the new entry.” |
| Recurrence‑Based | Linear recurrence | “The table follows (a_{i,j}=a_{i-1,j}+a_{i,j-1}). Find (a_{5,5}).” |
3. Detailed Theory & Derivations
3.1 Arithmetic Progression Tables
Row‑wise AP
- Let row (r) start at (a_r) with common difference (d_r).
- The element in column (c) is (T(r,c)=a_r+(c-1)d_r).
Column‑wise AP (transpose of above).
Edge case
- If (d_r=0), all cells in row (r) are constant.
- If (a_r) is negative, the sequence still follows the formula; only the sign flips.
3.2 Geometric Progression Tables
Row‑wise GP
- (T(r,c)=a_r r^{,c-1}).
Computation shortcut
- Use exponentiation by squaring for large (c).
Edge case
- (r=1) → all entries equal to (a_r).
- (r=-1) → alternating sign.
3.3 Mixed / Combined Patterns
Row‑wise AP + Column‑wise GP
- (T(r,c)=a_r + (c-1)d_r) followed by multiplying by (r^{c-1}).
- Often appears in salary tables (fixed increment + bonus percentage).
Recurrence on Two Indices
- Example: (T(i,j)=T(i-1,j)+T(i,j-1)).
- Solution via combinatorics: (T(i,j)=\binom{i+j-2}{i-1} a_{1,1}) if the initial row/column are all equal to (a_{1,1}).
**