Quantitative Aptitude – Tables
MIT‑Level Study Notes
Goal: Equip you with a rigorous, first‑principles understanding of tables as a tool in quantitative aptitude, covering construction, manipulation, advanced theory, edge cases, and a challenging application.
1. What is a Table?
| Concept | Formal Definition | Example |
|---|---|---|
| Table | A 2‑dimensional array (T[i][j]) of real numbers (or other data types) indexed by row‑index (i) and column‑index (j). | Multiplication table (T[i][j] = i \times j). |
| Row | Collection of entries sharing the same row‑index. | Row 3 in a multiplication table contains (3\times1, 3\times2, \dots). |
| Column | Collection of entries sharing the same column‑index. | Column 5 contains (1\times5, 2\times5, \dots). |
| Matrix | A finite table of numbers that can be added, multiplied, inverted, etc. | (A = \begin{bmatrix} a_{11} & a_{12}\ a_{21} & a_{22}\end{bmatrix}). |
Why tables matter in aptitude?
- They encode combinatorial relationships (e.g., Pascal's triangle).
- They allow tabular (or lattice) methods for solving linear equations, counting problems, and probability computations.
- They provide an efficient way to store pre‑computed values (e.g., powers of 2, factorials, binomial coefficients).
2. Foundations: From Sets to Tables
-
Set of indices
- Let (R = {r_1, r_2, \dots, r_m}) be the set of row indices.
- Let (C = {c_1, c_2, \dots, c_n}) be the set of column indices.
-
Mapping
- Define a function (f: R \times C \to \mathbb{R}).
- The table is the image of this mapping: (T[i][j] = f(r_i, c_j)).
-
Properties
- Symmetry: (f(r_i, c_j) = f(r_j, c_i)) when the problem is symmetric.
- Recurrence: Many tables satisfy a recurrence relation, e.g., Pascal’s triangle:
[ \binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} ]
-
Construction Algorithms
- Iterative: Nested loops over (R) and (C).
- Recursive: Use a recurrence relation to fill entries one by one.
- Dynamic programming: Store intermediate results in the table to avoid recomputation.
3. Types of Tables in Quantitative Aptitude
| Category | Typical Content | Key Properties | Use‑Case |
|---|---|---|---|
| Arithmetic tables | Multiplication, division, powers, roots, exponentials | Linear or polynomial relationships | Quick lookup for calculations |
| Percentage & ratio tables | 1%, 5%, 10% of a number; ratio a:b → a*k, b*k |
Proportional scaling | Solving proportion problems |
| Probability tables | Outcomes of dice, cards, random experiments | Sum of probabilities = 1 | Compute joint, marginal probabilities |
| Combinatorial tables | Permutations (P(n,k)), combinations (C(n,k)), binomial coefficients | Symmetry, recurrence | Counting arrangements, distributing items |
| Pascal’s Triangle | Binomial coefficients; powers of ((x+y)^n) | Symmetric, recursive | Expanding binomials, probabilities of binomial trials |
| Logarithm tables | (\log_{10}x) |