📚 Quantitative Aptitude – Tables
Prepared for the Kerala Police Sub‑Inspector (SI) Exam
MIT‑level treatment: first principles → advanced theory → edge cases → challenging problem.
1. What is a “Table” in Quantitative Aptitude?
| Aspect | Definition | Example |
|---|---|---|
| Data Table | A rectangular array of numbers arranged in rows and columns. Each entry is a function of its row and column indices. | 10 × 10 multiplication table |
| Computation Table | A pre‑computed table that speeds up mental or mechanical calculations (e.g., logarithm tables, conversion tables). | Logarithm table for 1–100 |
| Problem‑Solving Table | A tabular representation of variables and constraints used to solve systems of equations (augmented matrices, Cramer’s rule). | Augmented matrix of a 3 × 3 linear system |
In the SI exam, the “tables” section usually focuses on multiplication tables and pattern recognition using tables, but a solid understanding of the underlying mathematics is essential for tackling edge cases and advanced questions.
2. First Principles – Constructing a Multiplication Table
Let
[ T_{n}={,t_{ij}\mid 1\le i,j\le n,} ]
be an (n\times n) multiplication table, where each entry
[ t_{ij}=i\cdot j . ]
2.1 Row/Column Sums
-
Row i:
[ R_i=\sum_{j=1}^{n}t_{ij}=i\sum_{j=1}^{n}j=i\frac{n(n+1)}{2}. ] -
Column j:
[ C_j=\sum_{i=1}^{n}t_{ij}=j\sum_{i=1}^{n}i=j\frac{n(n+1)}{2}. ]
Thus each row sum is a multiple of the row index, and each column sum is a multiple of the column index.
2.2 Total Sum of All Entries
[ S_n=\sum_{i=1}^{n}\sum_{j=1}^{n}ij =\left(\sum_{i=1}^{n}i\right)!\left(\sum_{j=1}^{n}j\right) =\left(\frac{n(n+1)}{2}\right)^2. ]
Proof: Factor the double sum as a product of two single sums because the summand is separable: (ij = i\times j).
2.3 Symmetry
Since multiplication is commutative, [ t_{ij}=t_{ji}\quad\text{for all } i,j. ] Thus the table is symmetric about the main diagonal. This allows many shortcuts:
- The number of distinct entries is
[ \frac{n(n+1)}{2} ] (counting each pair (i<j) once and the diagonal once).
3. Advanced Properties & Theoretical Extensions
3.1 Diagonal Analysis
- Main diagonal: entries (t_{ii}=i^2).
Sum:
[ D_{\text{main