Mathematics
Learning Objectives
- Understand the fundamental concepts of Mathematics
- Apply key formulas and techniques to solve problems
- Practice with exam-level questions to build speed and accuracy
Arithmetic Foundations
1.1 Number Systems and Place Value
The decimal number system, which uses ten symbols from 0 to 9, forms the backbone of all quantitative reasoning in the examination. Each digit occupies a place that represents a power of ten, so the value of a numeral is the sum of its digits multiplied by the corresponding powers of ten. Understanding this positional notation allows a candidate to convert between standard form, expanded form, and scientific notation without hesitation. The concept of place value also underpins the rules for rounding, estimation, and the manipulation of large numbers that appear in data‑interpretation sets.
Beyond the familiar base‑ten system, the binary, octal and hexadecimal bases occasionally surface in questions that test logical reasoning rather than computation. A binary digit, or bit, represents a power of two, and the conversion between bases follows the same principle of positional weighting. Recognising that the same algorithm — repeated division by the target base and collection of remainders — works for any base eliminates the need to memorise separate procedures. This unified view of number systems is a recurring theme in the quantitative module.
1.2 Operations with Integers, Fractions, and Decimals
Arithmetic operations on integers obey the familiar commutative, associative and distributive laws, which remain valid when the operands are extended to fractions and decimals. Addition and subtraction of fractions require a common denominator, a step that is essentially the application of the least common multiple of the denominators. Multiplication of fractions is straightforward: multiply numerators together and denominators together, then reduce the product by cancelling common factors. Division of fractions is performed by multiplying by the reciprocal, a rule that follows directly from the definition of division as the inverse of multiplication.
Decimals are merely fractions whose denominators are powers of ten; therefore the same algorithms apply after aligning the decimal points. When multiplying decimals, the total number of decimal places in the product equals the sum of the decimal places in the factors. This rule is a direct consequence of the powers‑of‑ten representation. Mastery of these operations enables rapid simplification of complex expressions that appear in profit‑loss, time‑work and data‑interpretation problems.
1.3 Ratio, Proportion and Variation
A ratio expresses the relative magnitude of two quantities of the same kind, written as a:b or a/b. When two ratios are equal, they form a proportion, which can be solved by cross‑multiplication because the product of the means equals the product of the extremes. This property is derived from the fundamental equality of fractions and is the cornerstone of many word problems involving mixtures, partnerships and speed‑time‑distance relationships.
Direct variation occurs when an increase in one quantity causes a proportional increase in another, so the ratio of the two quantities remains constant. Inverse variation, by contrast, keeps the product of the two quantities constant. Recognising which type of variation governs a situation allows the candidate to set up the correct equation instantly. For example, the time taken to complete a job varies inversely with the number of workers, while the distance covered varies directly with speed when time is fixed.
1.4 Percentages and Applications
Percentage is a ratio expressed per hundred, and the conversion between fraction, decimal and percentage forms is a matter of multiplying or dividing by 100. The concept of percentage change — increase or decrease — is calculated by dividing the absolute change by the original value and multiplying by 100. This formula is symmetric: a 20 % increase followed by a 20 % decrease does not restore the original value because the base for the second calculation has changed. Understanding this asymmetry prevents a common error in successive‑percentage problems.
Applications of percentages permeate profit‑loss, discount, interest, and data‑interpretation questions. In profit‑loss, the cost price serves as the base for profit or loss percentage, while the selling price becomes the base for discount percentage. In simple interest, the principal is the base for the interest percentage per annum. The ability to shift the base correctly and to apply the percentage‑change formula repeatedly is a decisive skill for high‑scoring candidates.
Algebraic Techniques
2.1 Algebraic Expressions and Identities
An algebraic expression combines variables, constants and arithmetic operations. The fundamental identities — such as (a + b)² = a² + 2ab + b², (a − b)² = a² − 2ab + b², and a² − b² = (a + b)(a − b) — are derived from the distributive law and are indispensable for factorisation and expansion. Recognising these patterns in a problem statement allows a candidate to rewrite a cumbersome expression in a simpler form, often revealing a hidden factor or a perfect square that leads directly to the solution.
Beyond the basic identities, the sum and difference of cubes, a³ + b³ = (a + b)(a² − ab + b²) and a³ − b³ = (a − b)(a² + ab + b²), appear in higher‑order simplification tasks. The binomial theorem, which gives the expansion of (a + b)ⁿ for any positive integer n, is rarely required in full but the first few terms are useful for approximation questions. A solid grasp of these identities reduces algebraic manipulation to pattern recognition rather than laborious term‑by‑term multiplication.
2.2 Linear Equations in One and Two Variables
A linear equation in one variable has the form ax + b = 0, where a ≠ 0. Its solution is x = −b/a, obtained by isolating the variable using inverse operations. When two linear equations in two variables are given, they represent straight lines in the Cartesian plane. The system may have a unique solution (intersecting lines), no solution (parallel lines), or infinitely many solutions (coincident lines). The condition for a unique solution is that the ratio of the coefficients of x and y are not equal, i.e. a₁/a₂ ≠ b₁/b₂.
The methods of substitution, elimination, and cross‑multiplication are algebraic equivalents of geometric intersection. Substitution expresses one variable in terms of the other and replaces it in the second equation. Elimination adds or subtracts multiples of the equations to cancel one variable. Cross‑multiplication, derived from Cramer’s rule, gives the solution directly as x = (b₁c₂ − b₂c₁)/(a₁b₂ − a₂b₁) and y = (c₁a₂ − c₂a₁)/(a₁b₂ − a₂b₁). Choosing the most efficient method depends on the numerical coefficients; elimination is often fastest when coefficients are small integers.
2.3 Quadratic Equations and Their Roots
A quadratic equation takes the standard form ax² + bx + c = 0 with a ≠ 0. Its roots are given by the quadratic formula x = [−b ± √(b² − 4ac)]/(2a). The discriminant Δ = b² − 4ac determines the nature of the roots: Δ > 0 yields two distinct real roots, Δ = 0 yields a repeated real root, and Δ < 0 yields a pair of complex conjugates. In the examination, only real roots are usually required, so a negative discriminant signals that the equation has no admissible solution in the given context.
Vieta’s relations connect the sum and product of the roots to the coefficients: sum = −b/a, product = c/a. These relations allow a candidate to construct a quadratic equation when the roots are known, or to evaluate symmetric expressions of the roots without solving the equation explicitly. Factorisation, completing the square, and the quadratic formula are three interchangeable routes; the choice is dictated by the simplicity of the coefficients and the presence of perfect‑square trinomials.
2.4 Progressions and Series
An arithmetic progression (AP) is a sequence where each term exceeds the preceding one by a constant difference d. The nth term is aₙ = a + (n − 1)d, and the sum of the first n terms is Sₙ = n/2 [2a + (n − 1)d]. A geometric progression (GP) has a constant ratio r between successive terms; its nth term is aₙ = arⁿ⁻¹ and the sum of the first n terms is Sₙ = a(rⁿ − 1)/(r − 1) for r ≠ 1. When |r| < 1, the infinite sum converges to a/(1 − r), a fact that appears in present‑value calculations.
Harmonic progression (HP) is the reciprocal of an AP; its terms are of the form 1/(a + (n − 1)d). The relationship between AP, GP and HP is often exploited in problems that ask for the middle term of three numbers in HP given the extremes. The method of differences, where the successive differences of a sequence eventually become constant, helps identify the degree of the polynomial generating the sequence and is a powerful tool for series‑completion questions.
Geometry and Mensuration
3.1 Euclidean Geometry Basics
Euclidean geometry rests on five postulates, the most famous being the parallel postulate, which states that through a point not on a given line exactly one line can be drawn parallel to the given line. From these axioms flow the theorems on angles, triangles, circles and polygons that constitute the bulk of geometry questions. The concept of congruence — figures that can be superimposed by rigid motions — is established through criteria such as SSS, SAS, ASA and RHS for triangles. Similarity, a weaker condition requiring equal corresponding angles and proportional sides, is governed by AA, SAS and SSS similarity criteria.
Angle properties are pivotal: vertically opposite angles are equal, a linear pair sums to 180°, and the interior angles of a triangle sum to 180°. The exterior angle theorem states that an exterior angle equals the sum of the two opposite interior angles. These facts are repeatedly used to set up equations in problems that provide a mixture of angle measures and algebraic expressions.
3.2 Triangles, Circles and Quadrilaterals
In any triangle, the side opposite the larger angle is longer, and the sum of any two sides exceeds the third side — the triangle inequality. Special triangles include the equilateral (all sides equal, all angles 60°), isosceles (two equal sides, base angles equal) and right‑angled triangles, where Pythagoras’ theorem a² + b² = c² holds for the hypotenuse c. The circumcentre, incentre, centroid and orthocentre are the four classical centres; their properties often appear in coordinate‑geometry variants.
A circle is defined as the locus of points equidistant from a fixed centre. The radius, diameter, chord, tangent and secant are the primary elements. The angle subtended by a chord at the centre is twice the angle subtended at any point on the remaining circumference. The tangent is perpendicular to the radius at the point of contact, and the lengths of tangents drawn from an external point to a circle are equal. Quadrilaterals such as parallelograms, rectangles, squares, rhombuses and trapeziums have characteristic angle and side relationships; for instance, the diagonals of a rectangle are equal and bisect each other, while those of a rhombus are perpendicular bisectors.
3.3 Surface Area and Volume of Solids
Mensuration extends planar geometry into three dimensions. The surface area of a solid is the sum of the areas of all its faces, while volume measures the space enclosed. For a cube of side a, surface area = 6a² and volume = a³. A cuboid with dimensions l, b, h has surface area = 2(lb + bh + hl) and volume = lbh. A right circular cylinder of radius r and height h has curved surface area = 2πrh, total surface area = 2πr(r + h) and volume = πr²h. A cone of radius r and slant height l has curved surface area = πrl, total surface area = πr(r + l) and volume = ⅓πr²h. A sphere of radius r has surface area = 4πr² and volume = ⅔πr³.
These formulae are not isolated; they are derived from integration of infinitesimal elements, but the examination expects direct recall and application. Composite solids — such as a cylinder surmounted by a hemisphere — require the candidate to add or subtract the relevant component areas and volumes, taking care not to double‑count shared surfaces. The ability to visualise the net of a solid and to identify which faces are exposed is a practical skill that reduces errors in multi‑part questions.
3.4 Coordinate Geometry Essentials
Coordinate geometry translates geometric problems into algebraic ones by assigning each point an ordered pair (x, y) in the Cartesian plane. The distance between two points (x₁, y₁) and (x₂, y₂) is √[(x₂ − x₁)² + (y₂ − y₁)²], a direct application of Pythagoras’ theorem. The midpoint formula ((x₁ + x₂)/2, (y₁ + y₂)/2) and the section formula for internal division in the ratio m:n are indispensable for problems involving medians, centroids and trisection points.
The equation of a straight line can be expressed in slope‑intercept form y = mx + c, point‑slope form y − y₁ = m(x − x₁), or general form Ax + By + C = 0. The slope m = tan θ, where θ is the inclination, determines parallelism (equal slopes) and perpendicularity (product of slopes = −1). The distance from a point (x₀, y₀) to a line Ax + By + C = 0 is |Ax₀ + By₀ + C|/√(A² + B²). Circles are represented by (x − h)² + (y − k)² = r², where (h, k) is the centre. Intersection of a line and a circle leads to a quadratic whose discriminant reveals the number of intersection points — a classic algebraic‑geometric link.
| Solid | Surface Area | Volume |
|---|---|---|
| Cube (side a) | 6a² | a³ |
| Cuboid (l, b, h) | 2(lb + bh + hl) | lbh |
| Cylinder (r, h) | 2πr(r + h) | πr²h |
| Cone (r, l) | πr(r + l) | ⅓πr²h |
| Sphere (r) | 4πr² | ⅔πr³ |
Commercial Arithmetic
4.1 Profit, Loss and Discount
Profit and loss calculations revolve around the cost price (CP) and selling price (SP). Profit occurs when SP > CP, and the profit percentage is (SP − CP)/CP × 100. Loss occurs when CP > SP, with loss percentage (CP − SP)/CP × 100. The marked price (MP) is the price before discount; discount is MP − SP, and discount percentage is (MP − SP)/MP × 100. A common pitfall is to apply profit or loss percentage on the wrong base — always verify whether the percentage refers to CP, SP or MP.
Successive discounts are not additive; a 20 % discount followed by a 10 % discount yields an effective discount of 28 %, not 30 %. The effective discount factor is (1 − d₁)(1 − d₂)… where each d is expressed as a decimal. Similarly, a profit of p % followed by a loss of p % does not return to the original price because the bases differ. These nuances are frequently tested through multi‑step word problems that combine markup, discount and profit‑loss in a single transaction chain.
4.2 Simple and Compound Interest
Simple interest (SI) is calculated uniformly on the original principal for the entire period: SI = P × R × T/100, where P is principal, R is annual rate, and T is time in years. The amount A = P + SI. Compound interest (CI) reinvests the interest each period, so the amount after n periods is A = P(1 + R/100)ⁿ for annual compounding. For half‑yearly or quarterly compounding, the rate is divided by the number of periods per year and the number of periods is multiplied accordingly.
The difference between CI and SI for two years at the same rate is P(R/100)², a handy shortcut that avoids computing both amounts separately. For three years, the difference is P(R/100)²[3 + R/100]. These formulas stem from the binomial expansion of (1 + R/100)ⁿ and are valuable when the question asks for the principal given the difference between CI and SI. Understanding the compounding frequency is crucial; a nominal annual rate of 12 % compounded quarterly yields an effective annual rate higher than 12 % because interest is earned on interest four times a year.
4.3 Time, Work and Pipes
The fundamental principle of time‑work problems is that work done is proportional to the number of workers and the time they work, assuming constant efficiency. If a person can complete a job in d days, his one‑day work is 1/d. For multiple workers, the combined one‑day work is the sum of individual one‑day works. The time to finish the job together is the reciprocal of the combined one‑day work. This additive property holds because work is a scalar quantity that aggregates linearly.
Pipes and cisterns are a direct analogue: an inlet pipe fills at a rate of 1/t per hour (t being the time to fill the tank alone), while an outlet pipe empties at a rate of −1/t. The net rate when several pipes operate simultaneously is the algebraic sum of their rates. If the net rate is positive, the tank fills; if negative, it empties. Problems often ask for the time to fill or empty a partially filled tank, which requires adding the initial fraction of the tank to the work equation.
4.4 Partnership and Alligation
In a partnership, profits are shared in proportion to the product of capital invested and the time for which it remains invested. If partners A and B invest amounts C₁ and C₂ for periods T₁ and T₂, the profit ratio is C₁T₁ : C₂T₂. When a partner joins or leaves mid‑year, the time factor must be adjusted accordingly. This principle extends to any number of partners and is the basis for solving problems that involve changing capital contributions.
Alligation is a rule for finding the ratio in which two or more ingredients at given prices must be mixed to produce a mixture at a desired price. The mean price lies between the extreme prices, and the differences between each extreme price and the mean price give the required ratio (inverse of the differences). Alligation can also be applied to problems of average speed, average marks, and concentration of solutions, wherever a weighted average is sought. The method reduces a system of linear equations to a simple visual diagram, dramatically cutting solution time.
| Parameter | Simple Interest | Compound Interest (Annual) |
|---|---|---|
| Formula for Amount | A = P + P·R·T/100 | A = P(1 + R/100)² |
| Interest Earned | P·R·T/100 | P[(1 + R/100)² − 1] |
| Difference (CI − SI) | — | P(R/100)² |
| Effect of Compounding Frequency | None | Higher frequency increases effective rate |
Data Interpretation
5.1 Tabular Data and Bar Charts
Tables present raw numbers in rows and columns; the first step is to identify the variables, units and any totals or averages already provided. Bar charts translate the same data into vertical or horizontal bars whose lengths are proportional to the values. Reading a bar chart requires noting the scale, the baseline, and whether the bars are grouped or stacked. Grouped bars allow comparison across categories for each sub‑group, while stacked bars show the composition of a total. In both formats, the candidate must be able to compute percentages, ratios and growth rates directly from the visual representation without reconstructing the entire table.
Approximation is often sufficient: if a bar reaches halfway between 40 and 50 on a scale marked in tens, the value is about 45. This skill prevents unnecessary precise calculations when the answer choices are widely spaced. However, when the options are close, exact reading of the scale becomes necessary. Practising with a variety of scales — linear, logarithmic, or broken — builds the flexibility to handle any chart the examination may present.
5.2 Line Graphs and Pie Charts
Line graphs plot a continuous variable against another, typically time on the horizontal axis. The slope of a segment indicates the rate of change; a steeper slope means a faster increase or decrease. The area under a line graph does not generally represent a meaningful quantity unless the graph is a velocity‑time plot, which is rare in this module. Pie charts divide a circle into sectors whose central angles are proportional to the component values. The angle of a sector equals (component value/total value) × 360°. Converting between percentages, angles and absolute values is a routine operation.
When multiple pie charts represent the same total for different years, the candidate can compare sector angles directly to assess growth or decline of each component. A common trap is to assume that a larger angle always means a larger absolute increase; the total may have changed, so the absolute value must be recomputed using the new total. Line graphs and pie charts together often appear in a single data‑interpretation set, requiring the candidate to switch between trend analysis and composition analysis seamlessly.
5.3 Caselet Reasoning
A caselet is a paragraph that embeds numerical information in a narrative. The first task is to extract the data and organise it into a table or a set of equations. Typical caselets involve a small business scenario with production, sales, profit, and employee details. The candidate must identify the knowns, the unknowns, and the relationships — often linear — that link them. Because the data is not pre‑structured, the ability to create a clean representation is the primary differentiator between a quick solution and a messy trial‑and‑error attempt.
Logical deductions such as “if A is twice B and the sum is 90, then A = 60 and B = 30” are frequent. The caselet may also contain conditional statements (“if the price rises by 10 %, demand falls by 5 %”) that translate into percentage‑change equations. Practising the conversion of prose into algebraic form under timed conditions sharpens this skill. The final answer is usually a single number — total profit, number of units, or a percentage — which must be derived without ambiguity.
5.4 Approximation and Estimation Techniques
Approximation is not a sign of laziness but a strategic tool when exact computation would consume disproportionate time. Rounding numbers to the nearest convenient base — such as 10, 100, or 1000 — simplifies multiplication and division. For example, 498 × 52 can be approximated as 500 × 50 = 25 000, which is within 2 % of the exact product 25 896. The error introduced is often smaller than the gap between answer choices, making the approximation decisive.
Fractional approximations like 1/7 ≈ 0.14, 1/9 ≈ 0.11, and 1/11 ≈ 0.09 are useful for quick percentage conversions. The rule of 72 — dividing 72 by the annual interest rate to estimate the doubling time in years — is a classic shortcut for compound‑interest questions. Estimation also applies to geometry: the diagonal of a rectangle with sides 6 and 8 is exactly 10, but for sides 7 and 9 the diagonal is √130 ≈ 11.4, which can be bounded between 11 and 12. These techniques, when internalised, allow a candidate to navigate the quantitative section with confidence and speed.
Mastery of the topics covered in this lesson provides a comprehensive toolkit for tackling every quantitative question that may appear in the examination.
Number Theory: Divisibility, HCF, LCM and Their Applications
Divisibility rules form the backbone of rapid mental arithmetic. A number is divisible by 2 if its last digit is even; by 3 if the sum of its digits is a multiple of 3; by 4 if the last two digits form a number divisible by 4; by 5 if the last digit is 0 or 5; by 6 if it satisfies both 2 and 3; by 8 if the last three digits are divisible by 8; by 9 if the digit sum is a multiple of 9; by 11 if the alternating sum of digits is a multiple of 11. For 7, 13 and 17 the rules are less common but can be derived: for 7, double the last digit and subtract from the truncated number; repeat until a known multiple appears. These shortcuts allow a candidate to test factors of large numbers in seconds.
The Highest Common Factor (HCF) and Lowest Common Multiple (LCM) are linked by the identity HCF(a, b) × LCM(a, b) = a × b for any two positive integers. The Euclidean algorithm computes HCF efficiently: repeatedly replace the larger number by the remainder of division until the remainder is zero; the last non‑zero remainder is the HCF. For more than two numbers, HCF is associative — HCF(a, b, c) = HCF(HCF(a, b), c) — and similarly for LCM. Prime factorisation provides an alternative: write each number as a product of primes; HCF takes the minimum exponent for each prime, LCM the maximum.
Applications appear in problems on synchronisation, tiling, and remainder patterns. For instance, three bells toll at intervals of 18, 24 and 30 seconds; they will toll together again after LCM(18, 24, 30) = 360 seconds. In a remainder problem, “find the smallest number which when divided by 5, 6, 7 leaves remainders 3, 4, 5 respectively” translates to N ≡ -2 (mod 5), N ≡ -2 (mod 6), N ≡ -2 (mod 7) ⇒ N + 2 is a common multiple of 5, 6, 7 ⇒ N = LCM(5, 6, 7) – 2 = 210 – 2 = 208. Mastery of these techniques turns seemingly heavy calculations into a few lines of reasoning.
Permutations, Combinations and Probability Fundamentals
The distinction between permutation (ordered arrangement) and combination (unordered selection) is the first decision point. The number of permutations of r objects chosen from n distinct objects is P(n, r) = n! / (n – r)!. The number of combinations is C(n, r) = n! / [r! (n – r)!]. When objects are not all distinct, the formula adjusts: for a multiset with n total items where n₁ are alike of one kind, n₂ of another, …, the permutations are n! / (n₁! n₂! …). Circular permutations of n distinct objects equal (n – 1)! because one position can be fixed as reference.
Probability builds on these counts. For an experiment with equally likely outcomes, P(E) = favourable outcomes / total outcomes. The addition rule for mutually exclusive events: P(A ∪ B) = P(A) + P(B). For non‑mutually exclusive events, subtract the intersection: P(A ∪ B) = P(A) + P(B) – P(A ∩ B). The multiplication rule for independent events: P(A ∩ B) = P(A) × P(B). Conditional probability P(A|B) = P(A ∩ B) / P(B) provided P(B) > 0. Bayes’ theorem reverses the conditioning: P(A|B) = P(B|A) P(A) / P(B).
Typical examination questions combine these concepts. “A committee of 5 is to be formed from 7 men and 6 women. In how many ways if at least 3 women must be included?” Solution: sum over women = 3, 4, 5: C(6,3)C(7,2) + C(6,4)C(7,1) + C(6,5)C(7,0) = 20×21 + 15×7 + 6×1 = 420 + 105 + 6 = 531. Another classic: “Two dice are thrown. Probability that the sum is 9 given that at least one die shows a 4.” Favourable pairs with a 4: (4,5), (5,4), (4,4). Only (4,5) and (5,4) give sum 9. Total outcomes with at least one 4 = 11. Hence probability = 2/11. Practising such mixed problems develops the habit of first deciding whether order matters, then applying the correct counting principle before computing probability.
Event A = exactly two red. Choose 2 red from 5 and 1 non‑red from 7: C(5,2)×C(7,1) = 10×7 = 70. So P(A) = 70/220 = 7/22.
Event B = at least one red. Complement: no red = choose 3 from 7 non‑red = C(7,3) = 35. So P(B) = 1 – 35/220 = 185/220 = 37/44.
Since A ⊂ B, P(A∩B) = P(A). Conditional probability P(A|B) = P(A)/P(B) = (7/22) ÷ (37/44) = (7/22)×(44/37) = 14/37.
Answer: 14/37.
Advanced Mensuration: Frustums, Spheres and Composite Solids
A frustum of a right circular cone is obtained by slicing the cone with a plane parallel to its base. If the original cone has height H and base radius R, and the removed top cone has height h and radius r, similarity gives r/R = h/H. The volume of the frustum is V = (πh/3)(R² + Rr + r²) where h = H – h is the frustum height. The curved surface area is π(R + r)l with slant height l = √[(R – r)² + h²]. The total surface area adds the areas of the two circular ends: πR² + πr².
For a sphere of radius R, volume = 4πR³/3 and surface area = 4πR². A spherical segment (cap) of height h cut from a sphere has volume V = πh²(R – h/3) and curved surface area = 2πRh. A spherical zone between two parallel planes at distances h₁ and h₂ from the centre has volume = π(h₂ – h₁)(R² – (h₁² + h₁h₂ + h₂²)/3) and curved area = 2πR(h₂ – h₁). These formulas are derived by integration but are standard results that can be memorised.
Composite solids appear frequently: a cylinder with a hemispherical top, a cone mounted on a hemisphere, or a cuboid with a cylindrical hole drilled through. The strategy is always decomposition — compute volumes and surface areas of the simple components, then add or subtract. For surface area, remember that internal faces created by joining solids are not exposed and must be excluded. Example: a solid formed by a cylinder of radius r and height h surmounted by a hemisphere of same radius. Total volume = πr²h + 2πr³/3. Total surface area = curved surface of cylinder (2πrh) + curved surface of hemisphere (2πr²) + base of cylinder (πr²) = 2πrh + 3πr². The circular interface between cylinder and hemisphere is internal and omitted.
Functions, Inequalities and Logarithmic Manipulations
A function f: A → B assigns each element of domain A a unique image in codomain B. In quantitative aptitude, the focus is on real‑valued functions of a real variable. Common types: linear f(x) = ax + b, quadratic f(x) = ax² + bx + c, rational f(x) = P(x)/Q(x), exponential f(x) = aˣ (a > 0, a ≠ 1), logarithmic f(x) = logₐ x (a > 0, a ≠ 1). Composition f(g(x)) and inverse functions appear when solving equations like f(f(x)) = x.
Inequalities require careful handling of sign changes. For linear inequality ax + b > 0, solution is x > –b/a if a > 0, else x < –b/a. Quadratic inequality ax² + bx + c > 0 is solved by finding roots (if real) and testing intervals; the sign of a determines whether the parabola opens upward (solution outside roots) or downward (solution between roots). Absolute value inequalities |x – a| < b translate to –b < x – a < b ⇒ a – b < x < a + b. For |x – a| > b, the solution splits: x < a – b or x > a + b.
Logarithmic identities are indispensable: logₐ(xy) = logₐ x + logₐ y; logₐ(x/y) = logₐ x – logₐ y; logₐ(xᵏ) = k logₐ x; change of base logₐ x = log_b x / log_b a. The natural logarithm ln x uses base e ≈ 2.71828. Exponential‑logarithmic equations often reduce to quadratic form after substitution. Example: solve 2ˣ + 2⁻ˣ = 5. Let y = 2ˣ > 0, then y + 1/y = 5 ⇒ y² – 5y + 1 = 0 ⇒ y = (5 ± √21)/2. Since y > 0 both roots are valid, giving x = log₂[(5 ± √21)/2]. Mastery of these manipulations enables quick resolution of problems that otherwise appear intractable.
Data Sufficiency and Logical Reasoning in Quantitative Sets
Data sufficiency questions present a problem followed by two statements. The task is to decide whether the data in the statements, individually or together, are sufficient to answer the question. The answer choices are standard: (A) Statement I alone sufficient, (B) Statement II alone sufficient, (C) Both together sufficient but neither alone, (D) Each alone sufficient, (E) Even together not sufficient. The key is not to solve completely but to assess solvability.
Approach: first, understand the question — what unknown must be determined? Then examine Statement I: can it uniquely determine the unknown? If yes, answer is A or D. If no, examine Statement II similarly. If neither alone works, combine them: does the system of equations/inequalities yield a unique solution? Watch for hidden constraints: integer requirements, positivity, geometric feasibility (triangle inequality), or multiple valid configurations that satisfy both statements but give different answers.
Common patterns: “Is x > y?” with statements giving x + y = 10 and x – y = 2. Together they give unique x, y, so sufficient. “What is the area of triangle ABC?” Statement I: sides are 5, 6, 7 — sufficient via Heron. Statement II: one angle is 60° — insufficient alone. Together they may overdetermine but still sufficient. Another trap: statements that are algebraically equivalent (e.g., 2x + 3y = 12 and 4x + 6y = 24) provide no new information. Practising a wide variety of data‑sufficiency sets trains the mind to recognise redundancy, contradiction, and the exact point where a unique answer emerges.
- Assuming that a larger LCM always means a larger number — LCM depends on prime exponents, not magnitude alone.
- Confusing permutations with combinations when the problem wording implies order does not matter (e.g., “select a team”).
- Forgetting to exclude internal surfaces when computing total surface area of composite solids.
- Applying the quadratic formula without checking the discriminant sign, leading to extraneous roots in inequality solutions.
- Treating logarithmic equations as linear after a single log property, missing domain restrictions (argument must be positive).
- In data sufficiency, solving the problem completely instead of stopping once sufficiency is established, wasting time.
- Overlooking the possibility that two statements together may still leave multiple valid solutions, making the answer (E).
Time, Speed and Distance: Relative Motion and Circular Tracks
The core relationship Distance = Speed × Time remains the anchor, but competitive questions layer relative motion, multiple movers, and circular tracks. When two bodies move in the same direction, their relative speed is the absolute difference of their speeds; when they move in opposite directions, the relative speed is the sum. This principle extends to trains crossing platforms, persons walking on moving walkways, and any scenario where a reference frame shifts.
Meeting Points on a Straight Line
If two objects start simultaneously from points A and B separated by distance D, moving toward each other with speeds u and v, they meet after time D/(u+v). The meeting point divides D in the ratio u:v. If they start at different times, adjust the head‑start distance before applying the relative‑speed formula.
Circular Tracks
On a circular track of length L, two runners with speeds a and b (a > b) running in the same direction meet every L/(a−b) units of time. The number of distinct meeting points equals the number of times the faster runner laps the slower before both return to the start simultaneously, which is (a−b)/gcd(a,b) if speeds are expressed as integer ratios. For opposite directions, they meet every L/(a+b) time units, and the number of distinct meeting points is (a+b)/gcd(a,b). When three or more runners are involved, pairwise analysis combined with LCM of individual meeting intervals yields the time when all meet at the starting point.
Applications to Trains and Platforms
A train of length ℓ crossing a platform of length p at speed v takes (ℓ+p)/v time. Two trains of lengths ℓ₁, ℓ₂ moving in opposite directions at speeds v₁, v₂ cross each other in (ℓ₁+ℓ₂)/(v₁+v₂). If they move in the same direction, the faster overtakes the slower in (ℓ₁+ℓ₂)/|v₁−v₂|. These formulas are direct applications of relative speed with the total distance being the sum of lengths.
Variable Speed and Average Speed
When a journey comprises segments with different speeds, the average speed is total distance divided by total time, not the arithmetic mean of speeds. For equal distances, the harmonic mean applies: 2v₁v₂/(v₁+v₂). For equal times, the arithmetic mean applies. Recognising which mean to use eliminates a common trap.
Boats, Streams and Escalators: Upstream Downstream Dynamics
Let the speed of a boat in still water be b and the speed of the stream be s. Downstream speed = b+s, upstream speed = b−s. The time to travel a distance d downstream is d/(b+s); upstream it is d/(b−s). The ratio of upstream to downstream times for the same distance is (b+s)/(b−s). This ratio is often given directly in problems to find b and s.
Round‑Trip and Average Speed
A boat going a distance d upstream and returning downstream takes total time d/(b−s) + d/(b+s) = 2bd/(b²−s²). The average speed for the round trip is 2d divided by this time, which simplifies to (b²−s²)/b. Note that the average speed is less than the still‑water speed b, a counter‑intuitive result that examiners exploit.
Escalator Problems
An escalator of length L moves at speed e. A person walks on it at speed p relative to the escalator. If the person walks in the same direction as the escalator, effective speed = p+e; opposite direction gives |p−e|. The number of steps visible on the escalator is constant; the person’s step count combined with the escalator’s movement yields equations like (p+e)t = L or (p−e)t = L. When two persons walk on the same escalator at different speeds, the ratio of their step counts equals the ratio of their effective speeds, allowing the escalator speed to be eliminated.
Multiple Boats and Streams
When two boats start from opposite banks and move toward each other, the meeting point divides the river width in the ratio of their still‑water speeds if the stream speed is uniform. If the stream speed varies, the problem reduces to relative speed in a moving medium, solved by adding the stream vector to each boat’s velocity vector.
Clocks and Calendars: Angular Speed and Day Counting
The hour hand moves 0.5° per minute (360°/12h = 30°/h = 0.5°/min). The minute hand moves 6° per minute (360°/60min). The second hand moves 6° per second. The relative speed of the minute hand with respect to the hour hand is 5.5° per minute. This single fact solves almost all clock‑angle problems.
Angle Between Hands
At H hours M minutes, the hour hand angle from 12 o’clock = 30H + 0.5M. The minute hand angle = 6M. The absolute difference gives the angle; if it exceeds 180°, subtract from 360° for the smaller angle. To find when the hands are at a given angle θ, solve |30H − 5.5M| = θ or 360°−θ. This yields two linear equations in M for each hour H.
Coincidence, Opposition, Right Angles
Hands coincide when 30H = 5.5M → M = (60H)/11. They are opposite (180°) when |30H − 5.5M| = 180 → M = (60H ± 360)/11. Right angles occur when the difference is 90° or 270°, giving four solutions per 12‑hour cycle. The number of coincidences in 12 hours is 11, not 12, because the 12th coincidence occurs at 12:00 which is the start of the next cycle.
Calendar Calculations
A normal year has 365 days = 52 weeks + 1 day → the day of the week advances by 1. A leap year (divisible by 4, except centuries not divisible by 400) has 366 days → advance by 2. To find the day of the week for a given date, compute the total odd days from a known reference (e.g., 1 Jan 1900 was Monday). Odd days = (years × 1 + leap years) mod 7. For months, use the standard month‑odd‑days table: Jan 3, Feb 0/1, Mar 3, Apr 2, May 3, Jun 2, Jul 3, Aug 3, Sep 2, Oct 3, Nov 2, Dec 3 (for non‑leap). Add the day of month, take mod 7.
Leap Year Rules and Century Exceptions
Year divisible by 400 is leap; divisible by 100 but not 400 is not leap; divisible by 4 but not 100 is leap. This rule creates a 400‑year cycle with 97 leap years. The calendar repeats every 400 years. For quick mental calculation, remember that 2000 was a leap year, 1900 was not.
Set Theory, Venn Diagrams and Inclusion–Exclusion Principle
A set is a well‑defined collection of distinct objects. The universal set U contains all elements under consideration. For two sets A and B, the union A∪B includes elements in A or B (or both); intersection A∩B includes elements in both. The complement A′ = UA. The cardinality formula |A∪B| = |A| + |B| − |A∩B| is the inclusion–exclusion principle for two sets.
Three‑Set Venn Diagrams
For three sets A, B, C, the principle extends to |A∪B∪C| = |A|+|B|+|C| − |A∩B| − |B∩C| − |C∩A| + |A∩B∩C|. The Venn diagram has eight regions: only A, only B, only C, only A∩B, only B∩C, only C∩A, all three, and none. Problems often give totals for some regions and ask for an unknown region. The systematic approach: fill the central region (all three) first, then the pairwise‑only regions, then the single‑only regions, using the given totals and the formula.
Applications to Survey Data
Typical questions: “In a survey of 200 people, 120 like tea, 90 like coffee, 50 like both. How many like neither?” Using |T∪C| = 120+90−50 = 160, so neither = 200−160 = 40. For three beverages, the same logic applies with the three‑set formula. When data is given in percentages, convert to absolute numbers using the total sample size before applying the formula.
Maximum and Minimum Overlap
Given |A| = a, |B| = b, and universal set size N, the maximum possible |A∩B| is min(a,b). The minimum possible |A∩B| is max(0, a+b−N). This follows from the fact that |A∪B| ≤ N. For three sets, the bounds on the triple intersection are derived similarly by considering extreme distributions of elements among the seven non‑empty regions.
De Morgan’s Laws and Complements
(A∪B)′ = A′∩B′ and (A∩B)′ = A′∪B′. These are useful when the problem gives information about complements (e.g., “neither A nor B”) and asks for union or intersection. Translating “neither” to complement of union simplifies the algebra.
Modular Arithmetic: Remainder Theorems, Euler and Fermat
Modular arithmetic studies integers under the equivalence relation a ≡ b (mod m) ⇔ m divides (a−b). The remainder when a is divided by m is the unique integer r ∈ {0,1,…,m−1} such that a ≡ r (mod m). Basic properties: if a ≡ b and c ≡ d (mod m), then a+c ≡ b+d, a−c ≡ b−d, ac ≡ bd (mod m). Powers can be reduced using these rules.
Remainder Theorem for Polynomials
For a polynomial f(x) with integer coefficients, the remainder when f(x) is divided by (x−a) is f(a). In modular terms, f(x) ≡ f(a) (mod x−a). This is used to find remainders of large numbers expressed as polynomials in the base. Example: remainder of 123456 divided by 9 is the sum of digits mod 9 because 10 ≡ 1 (mod 9), so the number ≡ sum of digits (mod 9).
Euler’s Totient Function φ(n)
φ(n) counts positive integers ≤ n that are coprime to n. For prime p, φ(p) = p−1. For prime power pᵏ, φ(pᵏ) = pᵏ−pᵏ⁻¹ = pᵏ(1−1/p). φ is multiplicative: if gcd(a,b)=1 then φ(ab)=φ(a)φ(b). Euler’s theorem: if gcd(a,n)=1 then a^φ(n) ≡ 1 (mod n). This reduces large exponents modulo n.
Fermat’s Little Theorem
Special case of Euler’s theorem for prime modulus p: if p ∤ a then a^(p−1) ≡ 1 (mod p). Also a^p ≡ a (mod p) for all a. This is the basis for many divisibility tests and for computing modular inverses: a^(p−2) is the inverse of a modulo p.
Chinese Remainder Theorem (CRT)
If moduli m₁, m₂, …, mₖ are pairwise coprime, the system x ≡ aᵢ (mod mᵢ) has a unique solution modulo M = m₁m₂…mₖ. The constructive solution: compute Mᵢ = M/mᵢ, find the inverse yᵢ of Mᵢ modulo mᵢ (i.e., Mᵢyᵢ ≡ 1 (mod mᵢ)), then x = Σ aᵢMᵢyᵢ (mod M). CRT is used to find the last few digits of large numbers by working modulo 2ᵏ and 5ᵏ separately and combining.
Wilson’s Theorem and Applications
For prime p, (p−1)! ≡ −1 (mod p). This gives a primality test (though not efficient for large p) and helps compute factorials modulo p. For composite n, (n−1)! ≡ 0 (mod n) except for n=4 where (3)! = 6 ≡ 2 (mod 4).
- Confusing relative speed direction: adding speeds when objects move in the same direction.
- Using arithmetic mean instead of harmonic mean for average speed over equal distances.
- Forgetting that the escalator length is constant; equating step counts without accounting for escalator movement.
- Misapplying the clock angle formula by using hour hand speed as 30° per hour instead of 0.5° per minute.
- Overlooking the century leap‑year exception (1900 not leap, 2000 leap) in calendar calculations.
- Neglecting the triple‑intersection term in three‑set inclusion–exclusion, leading to overcounting.
- Applying Fermat’s theorem when the base and modulus are not coprime, producing incorrect remainders.