Module 2 · UPSC CSAT (Paper 2)

Quantitative Aptitude

Updated 18 Nov 2026 · 10,787 words · 5 sections · illustrated
Updated 14 Nov 2026
Number system, percentages, profit-loss, time-work, speed-distance, data interpretation.
Number System · Percentages · Time-Work · Speed · DI
🎯 Take Mock Test
Number SystemPercentages BasicsProfit & LossTime & WorkSpeed Distance TimefeedsfeedsfeedsfeedsGS1 Quantitative Aptitude: sequential masteryExam hook: each topic tested in 2‑3 MCQsvlymbooq
Quantitative Aptitude Core Topic Flow for GS1 Exam Revision — Shows how core quantitative topics build sequentially for GS1. · Open the full diagram →

Learning Objectives

  • Understand the fundamental concepts of Quantitative Aptitude
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

1. Number System

1.1 Divisibility Rules and Their Applications

The foundation of rapid calculation in the number system rests on divisibility rules, which allow a candidate to decide whether a large integer can be divided by a small integer without performing long division. For instance, a number is divisible by 2 when its unit digit is even, by 3 when the sum of its digits is a multiple of 3, by 4 when the last two digits form a number divisible by 4, by 5 when the unit digit is 0 or 5, by 6 when it satisfies both the rules for 2 and 3, by 8 when the last three digits form a number divisible by 8, by 9 when the digit sum is a multiple of 9, by 10 when the unit digit is 0, and by 11 when the difference between the sum of digits in odd positions and the sum of digits in even positions is either 0 or a multiple of 11. Mastery of these rules enables quick elimination of answer choices in multiple‑choice questions and supports the simplification of fractions before further arithmetic.

1.2 Least Common Multiple and Highest Common Factor

The concepts of least common multiple (LCM) and highest common factor (HCF) are intertwined through the relationship LCM × HCF = product of the two numbers, a property that holds for any pair of positive integers. LCM is the smallest positive integer that is a multiple of each given number, while HCF is the largest positive integer that divides each of them without remainder. In problems involving periodic events — such as bells ringing at different intervals or runners meeting at a starting point — LCM determines the first simultaneous occurrence, whereas HCF is used when dividing quantities into the largest possible equal groups. The prime factorisation method, where each number is expressed as a product of primes raised to appropriate powers, provides a systematic way to compute both LCM (by taking the highest power of each prime) and HCF (by taking the lowest power of each common prime).

1.3 Remainder Theorem and Modular Arithmetic

When a polynomial f(x) is divided by (x − a), the remainder is f(a); this remainder theorem extends naturally to integers under modular arithmetic, where the remainder of a division by n is the residue class modulo n. In competitive examinations, questions often ask for the remainder of large powers such as 7100 divided by 5, which can be solved by observing the cyclicity of remainders: 7 ≡ 2 (mod 5), 21 ≡ 2, 22 ≡ 4, 23 ≡ 3, 24 ≡ 1, and the cycle repeats every four powers, so 7100 ≡ 2100 ≡ (24)25 ≡ 125 ≡ 1 (mod 5). Understanding cyclicity of unit digits and remainders reduces massive exponentiation to a few simple steps, a technique that is indispensable for time‑bound tests.

1.4 Surds, Indices and Unit Digit Cyclicity

Surds are irrational roots such as √2 or ∛5 that cannot be simplified to a rational number; they obey the laws of indices, for example √a × √b = √(ab) and (√a)2 = a. Indices (or exponents) follow rules like a^m × a^n = a^(m+n), a^m ÷ a^n = a^(m−n), and (a^m)^n = a^(mn). The unit digit of powers of any integer repeats in a cycle of at most four: for 2 the cycle is 2, 4, 8, 6; for 3 it is 3, 9, 7, 1; for 7 it is 7, 9, 3, 1; for 8 it is 8, 4, 2, 6. Recognising these cycles allows a candidate to answer questions such as “find the unit digit of 753” by dividing the exponent by 4, taking the remainder (1), and selecting the first element of the cycle (7). This skill, combined with the ability to rationalise denominators containing surds, completes the toolkit for number‑system questions.

Divisibility Rules for Common Divisors
DivisorRuleExample
2Unit digit is even1248
3Sum of digits divisible by 3123 (1+2+3=6)
4Last two digits form a number divisible by 43124 (24÷4=6)
5Unit digit 0 or 545, 100
6Divisible by both 2 and 3132
8Last three digits divisible by 81232 (232÷8=29)
9Sum of digits divisible by 9729 (7+2+9=18)
10Unit digit 050
11Difference of alternate digit sums is 0 or multiple of 11121 (1+1−2=0)

2. Percentages

2.1 Fraction Percentage Equivalents and Mental Conversion

Percentages are fractions with denominator 100, and the ability to convert between common fractions and their percentage equivalents is a hallmark of speed in quantitative aptitude. The most frequently used equivalents are 1/2 = 50%, 1/3 ≈ 33.33%, 1/4 = 25%, 1/5 = 20%, 1/6 ≈ 16.67%, 1/8 = 12.5%, 1/9 ≈ 11.11%, 1/10 = 10%, 1/12 ≈ 8.33%, and 1/16 = 6.25%. When a problem states “a number is increased by 12.5%”, recognising 12.5% as 1/8 allows the candidate to multiply the original number by 9/8 instead of performing decimal multiplication. Similarly, a decrease of 16.67% corresponds to multiplying by 5/6. This mental conversion reduces calculation time and minimises errors caused by decimal approximations.

2.2 Successive Percentage Change and Net Effect

When a quantity undergoes two successive percentage changes, the net percentage change is not the arithmetic sum of the two percentages but is given by the formula x + y + (xy/100), where x and y are the individual percentage changes (positive for increase, negative for decrease). This formula arises because the second change is applied to the already altered base. For example, a 20% increase followed by a 20% decrease yields a net change of 20 + (−20) + (20×−20)/100 = −4%, i.e., a 4% decrease overall. The same principle extends to three or more successive changes by applying the formula iteratively. Understanding this prevents the common mistake of assuming that equal percentage increase and decrease cancel each other.

2.3 Percentage Increase Decrease and Base Shifting

The percentage change between an initial value and a final value is calculated as (final − initial) ÷ initial × 100. A frequent source of error is using the wrong base: when a price is reduced by 20% and then increased by 20%, the base for the increase is the reduced price, not the original price, leading to a net loss. In problems involving “A is 25% more than B”, the relationship can be expressed as A = B × (1 + 25/100) = 1.25B, which implies B = A ÷ 1.25 = 0.8A, so B is 20% less than A. Recognising that the base shifts with each operation is essential for accurate interpretation of statements like “20% less than” versus “20% of”.

2.4 Applications in Profit Loss and Interest

Percentage concepts form the backbone of profit‑loss and simple‑compound interest calculations. Profit percentage is (profit ÷ cost price) × 100, while loss percentage is (loss ÷ cost price) × 100. Marked price, discount, and selling price are linked by selling price = marked price × (1 − discount%/100). In simple interest, the interest amount = principal × rate × time ÷ 100, and the amount = principal + interest. Compound interest uses the formula amount = principal × (1 + rate/100)^time, where the interest earned each period is added to the principal for the next period. The effective annual rate when compounding occurs more frequently than annually is (1 + r/n)^n − 1, with r as the nominal rate and n as the number of compounding periods per year. These formulas are direct applications of percentage growth and decay.

Example: Successive Percentage Change
A shopkeeper marks up the price of an article by 30% and then offers a discount of 20% on the marked price. What is the net profit or loss percentage?
Solution: Let the cost price be 100. After a 30% markup, marked price = 130. A 20% discount on 130 gives selling price = 130 × (1 − 20/100) = 130 × 0.8 = 104. Profit = 104 − 100 = 4. Profit percentage = (4 ÷ 100) × 100 = 4%. Using the successive change formula: net % = 30 + (−20) + (30×−20)/100 = 10 − 6 = 4% profit.
Exam‑Day Insight
In percentage questions, always identify the base explicitly before applying any formula. A quick check: if the problem says “A is 20% more than B”, write A = 1.2B; if it says “A is 20% less than B”, write A = 0.8B. This habit eliminates base‑confusion errors that are the most common cause of lost marks in the quant section.

3. Profit and Loss

3.1 Cost Price Selling Price and Marked Price Relationships

The three key prices in any transaction are cost price (CP), the amount paid to acquire the article; selling price (SP), the amount received from the buyer; and marked price (MP), the price displayed before any discount. The fundamental relationships are SP = CP + profit = CP − loss, and SP = MP × (1 − discount%/100). When a trader marks up the cost price by a certain percentage, the marked price becomes CP × (1 + markup%/100). These equations form a closed system: knowing any two of CP, SP, MP, profit%, loss%, discount%, or markup% allows the determination of the remaining variables. In examination questions, the data is often given in a mixed format — for example, “a 20% discount on the marked price yields a 10% profit” — requiring the candidate to set up simultaneous equations and solve for the unknown ratio of CP to MP.

3.2 Profit Percentage Loss Percentage and Discount Calculations

Profit percentage is always calculated on cost price unless explicitly stated otherwise, while discount percentage is calculated on marked price. A common trap is to compute profit on selling price, which yields a different figure. For instance, if CP = 80 and SP = 100, profit = 20, profit% on CP = 25%, but profit% on SP = 20%. The phrase “gain of 20% on selling price” translates to profit = 0.2 × SP, so CP = SP − 0.2SP = 0.8SP, implying a profit of 25% on CP. Discount calculations follow a similar pattern: a discount of 15% on MP means SP = 0.85MP. When successive discounts are offered, the equivalent single discount is not the sum but is given by d1 + d2 − (d1×d2)/100, derived from the same successive‑change principle used in percentages.

3.3 Successive Discounts and Equivalent Single Discount

When two discounts d1% and d2% are applied successively, the final selling price is MP × (1 − d1/100) × (1 − d2/100). The equivalent single discount D satisfies (1 − D/100) = (1 − d1/100)(1 − d2/100), which simplifies to D = d1 + d2 − (d1×d2)/100. For example, successive discounts of 20% and 10% give an equivalent discount of 20 + 10 − (200/100) = 28%. This formula is symmetric and extends to three or more discounts by repeated application. In problems where a trader wants to offer a single discount equivalent to a series of discounts, this calculation directly provides the answer without needing to assume a marked price.

3.4 Break Even Analysis and Margin Concepts

Break‑even occurs when total revenue equals total cost, i.e., SP × quantity = (fixed cost + variable cost per unit × quantity). The contribution margin per unit is SP − variable cost per unit, and the break‑even quantity = fixed cost ÷ contribution margin. Margin of safety measures how much sales can drop before losses occur, expressed as (actual sales − break‑even sales) ÷ actual sales. Although these concepts are more common in business studies, they appear in CSAT as word problems where a manufacturer’s fixed and variable costs are given, and the candidate must find the minimum number of units to sell to avoid loss. The underlying arithmetic is simple linear equations, but the phrasing tests the ability to translate a real‑world scenario into algebraic form.

Comparison of Discount Structures
StructureFormula for Equivalent Single DiscountExample (20% then 10%)
Two successive discounts d1, d2d1 + d2 − (d1×d2)/10020 + 10 − 2 = 28%
Three successive discounts d1, d2, d3Apply formula iteratively: first combine d1 and d2, then combine result with d320% then 10% then 5% → 28% then 5% → 28 + 5 − 1.4 = 31.6%
Number SystemPercentagesProfit & LossTime & WorkSpeed Distance TimefeedsfeedsfeedsfeedsExam hook: Art. 3 – Basic formulasMechanism: unitary method for ratiosvlymbooq
Quantitative Aptitude Core Concepts Flow Diagram for GS1 Exam — Shows how fundamental number concepts feed into percentages, profit‑loss, time‑work and speed‑distance‑time problems. · Open the full diagram →

4. Time and Work

4.1 Work Rate Concept and Unitary Method

The central idea in time‑work problems is that work done is the product of rate and time. If a person can complete a job in n days, the person’s one‑day work (rate) is 1/n of the total job. This unitary approach converts the problem into addition of fractions: when multiple agents work together, their rates add up. For example, if A finishes a task in 12 days and B in 18 days, A’s rate = 1/12, B’s rate = 1/18, combined rate = 1/12 + 1/18 = 5/36 per day, so together they finish in 36/5 = 7.2 days. The LCM method — taking the LCM of individual times as the total work unit — avoids fractions: LCM(12,18)=36 units of work; A does 3 units/day, B does 2 units/day, together 5 units/day, time = 36/5 days. Both methods are equivalent; the LCM method is often faster for mental calculation.

4.2 Combined Work and Efficiency Ratios

Efficiency is inversely proportional to the time taken for the same work. If A is twice as efficient as B, A takes half the time B takes. In problems where efficiencies are given in ratios, such as A:B:C = 3:2:1, the work done in a day by each is in the same ratio. The total work can be assumed as the sum of the ratio terms multiplied by a convenient factor, or the LCM of the times derived from the ratios. When workers join or leave midway, the work done in each phase is calculated separately using the rates applicable during that phase, and the sum of work done across phases equals the whole job. This segmentation technique is essential for problems where “A works for 3 days, then B joins, and they finish together”.

4.3 Pipes and Cisterns as Work Problems

Pipes filling or emptying a cistern are direct analogues of workers doing a job. An inlet pipe has a positive rate (fills the tank), an outlet pipe has a negative rate (empties the tank). If a pipe fills a tank in 6 hours, its rate = 1/6 tank per hour; if another empties it in 9 hours, its rate = −1/9 tank per hour. When both operate simultaneously, the net rate = 1/6 − 1/9 = 1/18 tank per hour, so the tank fills in 18 hours. Problems may involve multiple pipes opening at different times, or a leak that starts after the tank is partially filled. The same LCM technique applies: take LCM of all individual times as the tank capacity in units, compute each pipe’s units per hour, and sum them with appropriate signs.

4.4 Work and Wages Distribution

When a group of workers completes a job and the total wages are to be divided in proportion to the work done by each, the share of a worker = (worker’s rate ÷ sum of all rates) × total wages. If A, B, C work together and finish a job for ₹1800, with individual times 6, 8, 12 days respectively, their rates are 1/6, 1/8, 1/12. The ratio of rates = 4:3:2 (multiplying by LCM 24). Total parts = 9, so A gets 4/9 × 1800 = ₹800, B gets ₹600, C gets ₹400. If workers work for different durations, the work done by each = rate × days worked, and wages are divided in the ratio of these work amounts. This principle extends to situations where a worker is paid a fixed daily wage plus a bonus for early completion.

5. Speed Distance and Time

5.1 Basic Relationship and Unit Conversion

The fundamental relationship is speed = distance ÷ time, distance = speed × time, and time = distance ÷ speed. Consistency of units is critical: speed may be given in km/h while time is in minutes, or distance in metres while speed is in km/h. The conversion factors are 1 km/h = 5/18 m/s and 1 m/s = 18/5 km/h. For example, a speed of 90 km/h equals 90 × 5/18 = 25 m/s. In problems involving a journey with multiple segments, each segment’s distance, speed, and time must be expressed in compatible units before any addition or averaging. A common error is to average speeds by arithmetic mean when the distances are equal; the correct average speed for equal distances is the harmonic mean 2ab/(a+b), while for equal times it is the arithmetic mean (a+b)/2.

5.2 Relative Speed in Same and Opposite Directions

When two objects move in opposite directions, their relative speed is the sum of their individual speeds because the distance between them closes at the combined rate. When they move in the same direction, the relative speed is the absolute difference of their speeds, as the faster object gains on the slower one at that rate. This concept is used in problems of trains crossing each other, a train overtaking a man, or two persons running on a circular track. For instance, a train 200 m long running at 72 km/h crosses a man running at 6 km/h in the same direction. Convert speeds to m/s: train = 20 m/s, man = 5/3 m/s. Relative speed = 20 − 5/3 = 55/3 m/s. Time to cross = length of train ÷ relative speed = 200 ÷ (55/3) = 600/55 ≈ 10.9 seconds.

5.3 Average Speed for Equal Distances and Equal Times

Average speed for a whole journey is total distance ÷ total time. If a person travels a distance d at speed a and returns the same distance at speed b, total distance = 2d, total time = d/a + d/b = d(a+b)/(ab). Hence average speed = 2d ÷ [d(a+b)/(ab)] = 2ab/(a+b). This is the harmonic mean of the two speeds. If instead the person travels for equal times t at speeds a and b, total distance = at + bt = t(a+b), total time = 2t, average speed = (a+b)/2, the arithmetic mean. Recognising which condition applies — equal distances or equal times — is the key to selecting the correct formula. Many examination questions disguise the condition by stating “a man goes to his office at 30 km/h and returns at 50 km/h”, which implies equal distances.

5.4 Trains Boats and Streams Applications

Train problems often involve the length of the train and the length of a platform or bridge. The distance covered while crossing a stationary object equals the length of the train; while crossing a platform, it equals train length + platform length. For a train crossing another train, the distance is the sum of both lengths, and relative speed depends on direction. Boats and streams introduce the concept of still‑water speed (boat speed in still water) and stream speed. Downstream speed = boat speed + stream speed; upstream speed = boat speed − stream speed. If a boat takes 4 hours to go 40 km downstream and 5 hours to return, downstream speed = 10 km/h, upstream speed = 8 km/h. Solving the two equations gives boat speed = 9 km/h, stream speed = 1 km/h. These problems are solved by setting up two linear equations in the two unknowns.

21. Chinese Remainder Theorem and Simultaneous Congruences

The Chinese Remainder Theorem (CRT) provides a systematic way to solve a system of linear congruences with pairwise coprime moduli. Given congruences x ≡ a₁ (mod m₁), x ≡ a₂ (mod m₂), …, x ≡ aₖ (mod mₖ) where each mᵢ is coprime to the others, there exists a unique solution modulo M = m₁·m₂·…·mₖ. The constructive proof builds the solution as x = Σ aᵢ·Mᵢ·yᵢ (mod M), where Mᵢ = M/mᵢ and yᵢ is the modular inverse of Mᵢ modulo mᵢ (i.e., Mᵢ·yᵢ ≡ 1 (mod mᵢ)). In examinations, the moduli are often small (≤ 20) so the inverses can be found by inspection or the extended Euclidean algorithm. An example: “Find the smallest positive integer that leaves remainder 2 when divided by 3, remainder 3 when divided by 5, and remainder 2 when divided by 7.” The CRT yields the answer 23. When moduli are not coprime, the system may have no solution or a solution modulo the least common multiple; the condition for consistency is that for every pair i, j, aᵢ ≡ aⱼ (mod gcd(mᵢ, mⱼ)). Mastery of CRT allows rapid solving of “find the number” puzzles that otherwise require tedious trial and error.

Step‑by‑step algorithm

  1. Verify pairwise coprimality; if not, reduce each congruence by dividing by common factors and check consistency.
  2. Compute M as the product of all moduli.
  3. For each i, compute Mᵢ = M/mᵢ.
  4. Find yᵢ such that Mᵢ·yᵢ ≡ 1 (mod mᵢ) using the extended Euclidean algorithm.
  5. Calculate x = (Σ aᵢ·Mᵢ·yᵢ) mod M.
  6. If the problem asks for the smallest positive integer, take x if x > 0, otherwise add M.

Practice with three‑moduli sets builds speed; some aptitude questions limit to three congruences because the arithmetic stays manageable within the time limit.

22. Factorial Trailing Zeros and Prime Exponent Extraction

The number of trailing zeros in n! (base 10) equals the exponent of 10 in its prime factorisation, which is the minimum of the exponents of 2 and 5. Since factors of 2 far outnumber factors of 5, the count reduces to the exponent of 5 in n!. The standard formula is ⌊n/5⌋ + ⌊n/25⌋ + ⌊n/125⌋ + … until the division yields zero. For example, 100! has ⌊100/5⌋ + ⌊100/25⌋ = 20 + 4 = 24 trailing zeros. A common extension asks for the highest power of a composite number k dividing n!. Factorise k = p₁e₁ p₂e₂ …. For each prime pᵢ, compute its exponent in n! using the same floor‑sum method, then divide by eᵢ and take the floor. The answer is the minimum of these quotients. For instance, the highest power of 12 (= 2²·3) dividing 50! is min(⌊exp₂(50!)/2⌋, ⌊exp₃(50!)⌋). Here exp₂(50!) = 25+12+6+3+1 = 47, exp₃(50!) = 16+5+1 = 22. Thus ⌊47/2⌋ = 23 and 22; the limiting factor is 3, so the highest power is 22. Another twist: find the last non‑zero digit of n! in base 10. This requires removing pairs of (2,5) and computing the product of remaining residues modulo 10, often using cyclic patterns of 2, 3, 7, 9. While the full algorithm is lengthy, some questions restrict n to ≤ 30, allowing direct multiplication after stripping zeros.

Quick reference table for small n

Trailing zeros in n!
nZeros
102
204
256
307
5012
10024
CRT and Factorial Combined
Find the smallest positive integer N such that N ≡ 2 (mod 3), N ≡ 3 (mod 5), N ≡ 2 (mod 7) and N is a multiple of the number of trailing zeros in 100!.
First, trailing zeros in 100! = ⌊100/5⌋ + ⌊100/25⌋ = 20 + 4 = 24. So N must be a multiple of 24. Solve the CRT system: moduli 3,5,7 are pairwise coprime, M = 105. Compute M₁=35, inverse of 35 mod 3 → 35≡2, 2·2=4≡1 ⇒ y₁=2. M₂=21, inverse of 21 mod 5 → 21≡1 ⇒ y₂=1. M₃=15, inverse of 15 mod 7 → 15≡1 ⇒ y₃=1. x = (2·35·2 + 3·21·1 + 2·15·1) mod 105 = (140 + 63 + 30) mod 105 = 233 mod 105 = 23. The general solution is N = 23 + 105k. We need N ≡ 0 (mod 24). Test k=0 → 23 mod 24 = 23. k=1 → 128 mod 24 = 8. k=2 → 233 mod 24 = 17. k=3 → 338 mod 24 = 2. k=4 → 443 mod 24 = 11. k=5 → 548 mod 24 = 20. k=6 → 653 mod 24 = 5. k=7 → 758 mod 24 = 14. k=8 → 863 mod 24 = 23 (cycle length 24). Since 105 and 24 are coprime, the combined modulus is 2520. The smallest positive solution is found by solving 23 + 105k ≡ 0 (mod 24) ⇒ 105k ≡ 1 (mod 24) ⇒ 9k ≡ 1 (mod 24). Inverse of 9 mod 24 does not exist because gcd(9,24)=3, but 1 is not divisible by 3, so no solution? Wait, check: 105 ≡ 9 (mod 24). Equation 9k ≡ 1 (mod 24) has no solution because 9 and 24 share factor 3. Therefore no integer N satisfies both conditions simultaneously. The correct interpretation: the problem expects the smallest N that satisfies the three congruences and is a multiple of 24. Since the CRT solution set is 23 + 105k, we need 23 + 105k ≡ 0 (mod 24). As shown, no solution exists. Hence answer: “No such integer exists.”
Exam‑day strategy
When a question mixes CRT with a factorial property, solve each part independently first. Write the general CRT solution as a linear expression (a + Mk). Then impose the extra divisibility condition as a congruence on k. If the resulting linear congruence has no solution because the coefficient and modulus share a factor that does not divide the constant, state “no solution” confidently — this is a known pattern in some examiner traps.

23. Compound Interest with Varying Rates and Installments

Standard compound interest assumes a constant annual rate. In advanced problems, the rate may change each year, or the principal may receive periodic contributions (installments). For varying rates, the amount after n years is A = P × (1 + r₁/100) × (1 + r₂/100) × … × (1 + rₙ/100). If rates are given as percentages, convert each to a multiplier. An example: a principal of ₹10,000 at 5% for year 1, 6% for year 2, and 7% for year 3 yields A = 10000 × 1.05 × 1.06 × 1.07 = ₹11,938.10. When installments are added at the end of each year, each installment compounds for the remaining years. If an amount X is deposited annually for n years at a constant rate r, the future value is X × [(1+r)n - 1] / r (with r as a decimal). With varying rates, the formula becomes a sum: FV = Σk=1n X × Πj=k+1n (1 + rⱼ). An example: “A person invests ₹5,000 at the end of each year for 3 years. The interest rates are 8%, 9%, and 10% respectively. Find the total amount at the end of year 3.” Compute: first installment compounds for 2 years → 5000 × 1.09 × 1.10 = ₹5,995; second installment compounds for 1 year → 5000 × 1.10 = ₹5,500; third installment earns no interest → ₹5,000. Total = ₹16,495. When installments are made at the beginning of each period (annuity due), each installment gains one extra compounding period; multiply the ordinary annuity result by (1 + r) for constant rate, or adjust the product accordingly for varying rates. Another twist: find the present value of a series of future payments discounted at varying rates. The present value is PV = Σk=1n Cₖ / Πj=1k (1 + rⱼ). Practising both future‑value and present‑value variants ensures readiness for any phrasing.

Installment loan amortisation (constant rate)

For a loan of principal P repaid in n equal annual installments E at rate r, the installment is E = P·r·(1+r)n / [(1+r)n - 1]. The interest portion of the k‑th installment equals the outstanding principal before that payment times r. The principal repaid in that installment is E - interest. Building an amortisation table is rarely required in full; instead, questions ask for the interest paid in a specific year or the outstanding balance after a certain number of payments. Use the formula for outstanding balance after m payments: Bₘ = P·(1+r)m - E·[(1+r)m - 1]/r.

24. Circular Track Meeting Problems and Relative Motion

Circular track questions extend relative speed concepts to closed loops. Two or more runners start from the same point (or different points) and run in the same or opposite directions. The key is to work with the track length L as the “distance” for meeting calculations. When runners move in opposite directions, their relative speed is the sum of speeds; they meet every L / (v₁ + v₂) time units. When moving in the same direction, the faster gains on the slower at relative speed |v₁ - v₂|; they meet every L / |v₁ - v₂| time units. If three runners are involved, pairwise meeting times can be computed, but the time when all three meet simultaneously is the least common multiple of the pairwise meeting times (provided they start together). An example: “A and B run on a 400 m track. A runs at 5 m/s, B at 3 m/s, same direction. After how many seconds will A overtake B for the third time?” Relative speed = 2 m/s. Time for one overtaking = 400/2 = 200 s. Third overtaking = 3 × 200 = 600 s. If they start at different points, the initial separation must be added to the track length for the first meeting. For opposite directions, the first meeting occurs when the sum of distances covered equals the initial separation (or L if they start together). Another example: “A runs at 6 m/s, B at 4 m/s on a 600 m track. They start together but run in opposite directions. How many distinct meeting points will there be on the track before they both return to the start simultaneously?” The number of distinct meeting points equals the number of times they meet in one LCM of their lap times. Lap times: A = 100 s, B = 150 s. LCM = 300 s. In 300 s, A completes 3 laps, B completes 2 laps. They meet every L/(v₁+v₂) = 600/10 = 60 s. Number of meetings = 300/60 = 5. Since they start together, the meeting points are equally spaced; there are 5 distinct points. If the ratio of speeds is a rational number p/q in lowest terms, the number of distinct meeting points for same‑direction motion is |p - q|; for opposite directions it is p + q. This shortcut saves time.

Escalator problems as circular tracks

An escalator of length L moving at speed vₑ with a person walking at speed vₚ relative to ground is analogous to a circular track where the “track” moves. When the person walks in the direction of the escalator, effective speed = vₚ + vₑ; time to cover length = L/(vₚ+vₑ). Walking opposite gives L/|vₚ - vₑ|. If the person stands still, time = L/vₑ. An example: “A person takes 30 s to walk up a moving escalator and 90 s to walk down the same escalator. How long would he take if the escalator were stationary?” Let L be length, vₚ walking speed, vₑ escalator speed. Up: L = (vₚ+vₑ)·30. Down: L = (vₚ - vₑ)·90. Equate: 30(vₚ+vₑ) = 90(vₚ - vₑ) ⇒ vₚ+vₑ = 3vₚ - 3vₑ ⇒ 4vₑ = 2vₚ ⇒ vₚ = 2vₑ. Substitute: L = (2vₑ+vₑ)·30 = 90vₑ. Stationary time = L/vₚ = 90vₑ / 2vₑ = 45 s.

25. Advanced Data Interpretation: Caselets, Mixed Charts, and Approximation Strategies

Data Interpretation (DI) sets in competitive exams increasingly combine multiple chart types — bar, line, pie, table — within a single caselet. The first step is to read the narrative carefully and map each data representation to the relevant variable. For example, a caselet may describe a company’s quarterly revenue (bar chart), profit margin trend (line chart), and segment‑wise revenue share (pie chart). Questions often require cross‑referencing: “If the total revenue in Q3 was ₹200 cr and the profit margin was 12%, what was the absolute profit from the ‘Services’ segment which accounted for 30% of revenue?” Here profit = 200 × 0.12 = ₹24 cr; Services revenue = 200 × 0.30 = ₹60 cr; Services profit = 60 × 0.12 = ₹7.2 cr (assuming uniform margin). However, margins may differ by segment; the line chart could show segment‑wise margins. Always verify whether a given percentage applies globally or locally. Approximation is vital: when numbers are large (e.g., 1,23,45,678), round to the nearest thousand or lakh if answer options are spaced widely. Use the “percentage of percentage” shortcut: a% of b% of X = (a×b/100)% of X. For growth rates, the compound annual growth rate (CAGR) over n years from start value S to end value E is (E/S)1/n - 1. In some exams, CAGR is occasionally approximated by the arithmetic mean of yearly growth rates when the period is short and rates are small; use this cautiously. Another technique: when a table shows year‑on‑year percentage changes, the overall change after two years is not the sum but (1+r₁)(1+r₂) - 1. For quick mental calculation, if r₁=10% and r₂=20%, overall ≈ 32% (exact 1.1×1.2-1=0.32). Practice converting between absolute and relative figures: “Revenue increased by ₹50 cr, which is a 25% increase.” Then base revenue = 50/0.25 = ₹200 cr. Mixed charts may use different scales; always check axis labels and units (crores vs lakhs, thousands vs units). A systematic approach: (1) list all given figures with units, (2) identify the question’s required output unit, (3) perform conversions before arithmetic, (4) use approximation only when options differ by >5%.

Common DI question patterns

  • “What is the ratio of X in year A to Y in year B?" — extract both values, ensure same unit, simplify ratio.
  • “By what percentage did Z change from year 1 to year 3?" — compute absolute values for both years, then percentage change.
  • “If the total market size grew at 8% CAGR, what was the market size in year 5?" — apply compound growth formula.
  • “Which segment showed the highest absolute growth in rupees?" — calculate absolute growth for each segment using segment share and total revenue.
  • Assuming a percentage given for the whole applies uniformly to every sub‑category without checking the chart.
  • Forgetting to convert units (crores to lakhs, km to m) before comparing or adding numbers.
  • Using arithmetic mean of growth rates instead of compound formula when the question explicitly asks for CAGR.
  • Treating “percentage point change” and “percent change” as identical; a rise from 10% to 12% is a 2 percentage‑point increase but a 20% increase.
  • Over‑approximating when answer options are close (difference < 2%); this leads to selecting the wrong option.
  • Ignoring the direction of motion in circular track problems, leading to using sum of speeds instead of difference or vice versa.
  • In CRT problems, neglecting to verify pairwise coprimality and applying the standard formula to non‑coprime moduli, producing an incorrect “solution”.
The advanced sections above equip you with the mechanisms, exceptions, and examiner twists needed to tackle the toughest quantitative questions.

26. Euler's Totient Function and Fermat's Little Theorem in Remainder Problems

The Euler totient function φ(n) counts the positive integers up to n that are coprime to n. For a prime p, φ(p) = p‑1; for a prime power p^k, φ(p^k) = p^k – pk‑1. If n = ∏ p_ik_i, then φ(n) = n ∏ (1 – 1/p_i). This multiplicative property allows rapid computation of φ for large numbers once the prime factorisation is known. Fermat's Little Theorem states that if p is prime and a is not divisible by p, then ap‑1 ≡ 1 (mod p). Euler's theorem generalises this: for any a coprime to n, aφ(n) ≡ 1 (mod n). These results turn seemingly intractable exponentiation remainders into simple modular reductions. For example, to find the remainder of 7100 divided by 12, note φ(12) = 4. Since gcd(7,12)=1, 74 ≡ 1 (mod 12). Then 7100 = (74)25 ≡ 125 ≡ 1 (mod 12). When the base and modulus are not coprime, factor out the common divisor and apply the theorem to the reduced modulus. A common examiner twist is to ask for the last two digits of a large power, which is equivalent to computing modulo 100. Because φ(100)=40, any base coprime to 100 can have its exponent reduced modulo 40. For bases sharing factors with 100 (e.g., 2, 5), separate the power of 2 and 5 using the Chinese Remainder Theorem or direct pattern observation. Mastery of φ(n) and its interplay with Carmichael function λ(n) (the least universal exponent) gives an edge in problems where the exponent itself is a large expression, such as a^b^c mod m.

Key Properties and Shortcuts

  • φ(n) is even for all n > 2.
  • If n = 2^k with k ≥ 3, φ(n) = 2k‑1 but λ(n) = 2k‑2.
  • For n = pq (product of two distinct primes), φ(n) = (p‑1)(q‑1).
  • When solving a^b mod m, reduce b modulo φ(m) only if gcd(a,m)=1; otherwise use the method of successive squaring combined with factorisation of m.

27. Partnership and Profit Sharing with Time‑Weighted Capital

In a partnership, profit is distributed in proportion to the product of capital invested and the time for which it remains invested. If partner A invests C_A for T_A months and partner B invests C_B for T_B months, the profit sharing ratio is C_A·T_A : C_B·T_B. This extends to multiple partners and to situations where capital is added or withdrawn mid‑period. For instance, A starts with ₹50,000; after 4 months adds ₹20,000; after 8 months withdraws ₹10,000. The effective capital‑month contribution is 50,000×4 + 70,000×4 + 60,000×4 = 7,20,000 capital‑months. When partners receive salaries or interest on capital before profit division, those amounts are deducted from the total profit first. The remaining profit is then split according to the capital‑time ratio. A frequent twist: one partner is a sleeping partner who contributes only capital, while the working partner receives a management fee. The fee is treated as an expense, not part of profit sharing. Another variation involves changing profit‑sharing ratios after a certain period (e.g., due to admission of a new partner). In such cases, compute the profit for each sub‑period separately using the respective ratios, then aggregate each partner's share. The concept of "sacrificing ratio" and "gaining ratio" appears when an existing partner surrenders a fraction of his share to a new entrant; the new partner's share is taken from the old partners in their sacrificing ratio. Examiners often embed these ideas in word problems that also test percentage and average concepts, such as "A and B start a business with capitals in the ratio 3:2. After 6 months, A withdraws half his capital. If the annual profit is ₹1,20,000, find B's share." Here A's capital‑months = 3×6 + 1.5×6 = 27 units; B's = 2×12 = 24 units. Ratio 27:24 = 9:8. B's share = 8/17 × 1,20,000 = ₹56,470.59 (rounded as per options).

Technique: Capital‑Month Table
Three partners X, Y, Z invest ₹40,000, ₹60,000, ₹80,000 respectively. After 4 months, X adds ₹10,000; after 8 months, Y withdraws ₹20,000; Z keeps his investment unchanged throughout the year. Total profit at year‑end is ₹2,10,000. Find Z's share.
Step 1: Compute capital‑months for each partner.
X: 40,000 × 4 = 1,60,000; then 50,000 × 8 = 4,00,000. Total = 5,60,000.
Y: 60,000 × 8 = 4,80,000; then 40,000 × 4 = 1,60,000. Total = 6,40,000.
Z: 80,000 × 12 = 9,60,000.
Step 2: Ratio X:Y:Z = 5,60,000 : 6,40,000 : 9,60,000 = 56 : 64 : 96 = 7 : 8 : 12.
Step 3: Total parts = 7+8+12 = 27. Z's share = (12/27) × 2,10,000 = ₹93,333.33 (approx). If options are integers, the exact fraction 12/27 × 2,10,000 = 93,333⅓; the nearest option is chosen.
Exam‑Day Strategy
Draw a timeline for each partner; mark every change of capital with the month number. Convert each segment into capital‑months immediately. This avoids missing a withdrawal or addition. When profit includes salary or interest, subtract those first before applying the ratio. Always simplify the ratio to lowest terms before multiplying by total profit to reduce arithmetic errors.

28. Work Equivalence and Negative Work in Time‑Work Problems

The work equivalence principle states that if a group of workers can complete a task in a certain time, any other group with the same total efficiency will take the same time. Efficiency is defined as work done per unit time. When workers have different efficiencies, we can express each worker's efficiency relative to a base worker. For example, if A is twice as efficient as B, then A's work rate = 2 units/day, B's = 1 unit/day. The combined rate is 3 units/day. Negative work arises when a worker or agent undoes part of the work, such as a leak in a cistern or a worker who damages the product. In pipe‑cistern problems, an inlet pipe does positive work (filling), while an outlet pipe does negative work (emptying). The net rate is the algebraic sum of individual rates. If an inlet fills at 1/6 tank per hour and an outlet empties at 1/8 tank per hour, net rate = 1/6 – 1/8 = 1/24 tank per hour; time to fill = 24 hours. A more subtle case: multiple outlets with different opening times. Suppose a tank has two outlets; outlet A opens at start, outlet B opens after 2 hours. The work done by outlet A in the first 2 hours is negative and must be accounted separately. The general approach: break the timeline into intervals where the set of active workers/pipes is constant. Compute net work done in each interval, sum to the total work (usually 1 unit). Solve for unknown time or rate. Examiners also test "work and wages" where wages are proportional to work done. If A, B, C together earn ₹6,000 for a job and their efficiencies are in ratio 3:2:1, then A's wage = 3/6 × 6,000 = ₹3,000. When a worker joins late or leaves early, his wage share is based on his actual work contribution (efficiency × time). A classic trap: "A and B can do a work in 12 days. B and C in 15 days. C and A in 20 days. How long will A alone take?" Using work equivalence: let total work = LCM(12,15,20)=60 units. A+B = 5 units/day, B+C = 4, C+A = 3. Adding: 2(A+B+C)=12 → A+B+C=6. Then A = 6 – (B+C) = 6 – 4 = 2 units/day. Time for A alone = 60/2 = 30 days.

Negative Work with Variable Rates

When the rate of negative work changes (e.g., a leak that widens over time), the problem becomes a differential equation, but exam questions approximate by piecewise constant rates. For instance, a cistern has a leak that empties it in 10 hours when full. After half the water is gone, the leak rate halves because pressure drops. The time to empty the full cistern is not simply 10 hours; one must integrate or use average rate. In competitive exams, such problems are simplified: "A tank has a leak that can empty it in 8 hours. A tap fills it at 6 litres/min. The tank empties in 12 hours when both are open. Find capacity." Let capacity = C litres. Leak rate = C/8 litres per hour = C/480 litres per minute. Tap rate = 6 litres/min. Net emptying rate = C/480 – 6. Time to empty = C / (C/480 – 6) = 12 hours = 720 minutes. Solve: C = 720(C/480 – 6) → C = 1.5C – 4320 → 0.5C = 4320 → C = 8640 litres.

29. Races, Head Starts, and Meeting Points on Linear Tracks

Race problems involve two or more participants moving on a straight track with given speeds, often with head starts or different start times. The core concept is relative speed. If two runners start simultaneously from the same point in the same direction, the faster gains on the slower at a rate equal to the difference of their speeds. The time for the faster to lap the slower (on a circular track) or to be ahead by a certain distance (on a linear track) is distance / relative speed. On a linear track of length L, if A gives B a head start of h metres, then A must cover L metres while B covers L – h metres. Since time is same, L / v_A = (L – h) / v_B → v_A / v_B = L / (L – h). This ratio is often used to find the length of the track or the head start. When three runners are involved, pairwise meeting times can be computed. For example, A, B, C run on a 400 m circular track at speeds 5, 7, 9 m/s. They start together. The time when all three meet again at the starting point is LCM of their individual lap times: 400/5=80s, 400/7≈57.14s, 400/9≈44.44s. LCM of fractions is LCM(numerators)/HCF(denominators) after expressing in simplest fractional form. A more common question: "A and B run a 1 km race. A gives B a start of 100 m and still beats him by 20 seconds. If A gives B a start of 25 seconds, the race ends in a dead heat. Find A's speed." Let v_A, v_B be speeds in m/s. First condition: A runs 1000 m, B runs 900 m. Time_A = 1000/v_A, Time_B = 900/v_B. Time_B – Time_A = 20. Second condition: A runs 1000 m, B runs 1000 m but starts 25 s earlier. So Time_B = Time_A + 25. Solve the two equations to get v_A = 10 m/s, v_B = 8 m/s. Examiners also test "meeting point" problems: two persons start from opposite ends of a straight road, move towards each other, meet, continue to ends, turn back, meet again. The distance covered by each between meetings is in the ratio of their speeds. The total distance covered by both together between first and second meeting is twice the length of the road. This pattern extends to multiple meetings.

Head Start Expressed in Time vs Distance

A head start can be given as a distance (e.g., 50 m) or as a time (e.g., 10 s). If given as time, the distance covered by the starter in that time is v_starter × head_start_time. This distance then acts as the effective distance head start for the other runner. Always convert to a common unit before setting up equations. A typical twist: "In a 200 m race, A beats B by 20 m and C by 38 m. In a race of 300 m, by how much will B beat C?" When A runs 200, B runs 180, C runs 162. Ratio B:C = 180:162 = 10:9. In 300 m, when B runs 300, C runs 270. So B beats C by 30 m.

30. Data Interpretation with Missing Data and Logical Constraints

Advanced DI sets often present tables or charts with missing entries that must be deduced from logical constraints such as totals, percentages, or relationships between rows and columns. The first step is to identify all given figures and the constraints linking them. For example, a table shows quarterly sales of four products across three regions, with some cells blank. The row totals (product‑wise annual sales) and column totals (region‑wise quarterly sales) are provided. This creates a system of linear equations. Since the numbers are integers (sales units), the solution is often unique. A systematic approach: (1) list all known values, (2) write equations for each total, (3) solve sequentially starting with rows or columns having the fewest unknowns. When percentages are involved, convert to absolute numbers using a known base. If a pie chart shows percentage shares but the total is missing, look for an absolute figure elsewhere in the caselet (e.g., "Product A sold 12,000 units in Q1"). That absolute figure anchors the percentages. Another common constraint: "The ratio of sales in Region X to Region Y is 3:2 in Q2." This gives a linear relation between two missing cells. Examiners also embed logical conditions like "No region's sales decreased from Q1 to Q2" or "Product B's sales in Q3 were exactly the average of its Q1 and Q2 sales." These inequalities or equalities restrict the feasible values. In approximation‑heavy sets, the missing data may not need exact computation; instead, the question asks "Which of the following could be the value of …?" Use the constraints to bound the variable. For instance, if total sales = 1,00,000 and three products account for 30%, 25%, 20% respectively, the fourth product's share is 25% exactly. If the percentages are approximate (rounded to nearest integer), the fourth product's share lies between 24.5% and 25.5%. Always check whether percentages are exact or rounded. A frequent trap: a stacked bar chart where the segments represent percentages of different totals (e.g., each bar is 100% but the absolute totals differ across bars). Comparing segment heights across bars without adjusting for the different totals leads to errors. The correct method: compute absolute values for each segment using the bar's total (given or derived), then compare.

Caselet with Interlinked Tables

Consider a caselet: a company has three divisions — Alpha, Beta, Gamma. A table gives each division's revenue and profit margin for 2021 and 2022, but some margins are missing. A line chart shows the company‑wide profit margin trend. The text states: "Alpha's revenue grew by 20% in 2022; its profit margin remained unchanged. Beta's revenue fell by 10%; its profit margin increased by 2 percentage points. Gamma's revenue and margin both changed such that the overall company profit margin in 2022 was 15%." To solve, assign variables to missing margins, write revenue equations using growth rates, compute absolute profits, set up the overall margin equation (total profit / total revenue = 0.15). Solve for the unknowns. This tests ability to switch between percentage and absolute forms, and to handle simultaneous constraints.

  • Assuming φ(n) can be used to reduce exponents when base and modulus are not coprime.
  • Forgetting to subtract salary or interest on capital before distributing profit in partnership problems.
  • Treating negative work rates as positive when adding rates of inlet and outlet pipes.
  • Using the same head‑start distance for both time‑based and distance‑based advantages without conversion.
  • Ignoring the possibility that percentages in DI charts are rounded, leading to incorrect exact calculations.
  • Overlooking the need to convert all units to a common base before summing or comparing values in mixed charts.
  • Applying the LCM of lap times directly without converting to a common fractional form for circular track meeting problems.
The advanced sections above equip you with the mechanisms, exceptions, and examiner twists needed to tackle the toughest quantitative questions.

31. Base Conversion and Divisibility in Non‑Decimal Systems

Binary, octal, and hexadecimal representations appear regularly in quantitative aptitude papers. Any integer can be expressed in base b as a sum of digits multiplied by powers of b. Conversion from base b to decimal uses the expansion dkbk + dk-1bk-1 + … + d1b + d0. The reverse conversion repeatedly divides the decimal number by b, recording remainders. For example, decimal 45 to binary: 45 ÷ 2 = 22 rem 1, 22 ÷ 2 = 11 rem 0, 11 ÷ 2 = 5 rem 1, 5 ÷ 2 = 2 rem 1, 2 ÷ 2 = 1 rem 0, 1 ÷ 2 = 0 rem 1 → reading remainders upward gives 1011012.

Divisibility rules in other bases follow the same modular logic as base 10. A number in base b is divisible by b−1 if the sum of its digits is divisible by b−1 (analogue of the 9‑rule). It is divisible by b+1 if the alternating sum of digits is divisible by b+1 (analogue of the 11‑rule). For binary (b=2), divisibility by 3 corresponds to the alternating sum of bits. In hexadecimal (b=16), divisibility by 15 uses digit‑sum, and divisibility by 17 uses alternating sum. These shortcuts avoid full conversion when only a divisibility check is required.

Typical examiner twists: (1) a base-7 number divided by 6 — apply the digit‑sum rule in base 7; (2) “smallest 8‑bit number divisible by 5” — find the smallest multiple of 5 in 0–255; (3) mixed‑base arithmetic: add (123)4 and (321)5, express in base 6 — convert to decimal, add, convert to base 6. Mastery of these algorithms makes such problems solvable in under a minute.

Key Conversion Algorithms

  • Decimal → base b: repeated division, collect remainders in reverse order.
  • Base b → decimal: evaluate polynomial using Horner’s method: (((dk×b + dk-1)×b + … )×b + d0).
  • Base b → base c (both non‑decimal): convert to decimal first, then to target base; or use grouping when b and c are powers of the same integer (e.g., binary ↔ octal via groups of three bits, binary ↔ hexadecimal via groups of four bits).

Divisibility Shortcuts

  • Base b, divisor b−1: sum of digits ≡ 0 (mod b−1).
  • Base b, divisor b+1: alternating sum of digits ≡ 0 (mod b+1).
  • Base b, divisor d where d | (bk ± 1): group digits in blocks of k and apply sum or alternating sum.

32. Advanced Permutation and Combination with Constraints

Beyond the basic formulas nPr = n!/(n−r)! and nCr = n!/(r!(n−r!)), competitive exams test restricted arrangements. The most frequent constraints: (i) objects always together — treat the block as a single unit, then permute internally; (ii) objects never together — use the gap method: arrange unrestricted objects, then choose gaps for restricted ones; (iii) fixed positions — reduce the problem size by placing those objects first; (iv) circular permutations — for n distinct objects around a circle the count is (n−1)!; if reflections are identical (necklace problems), divide by 2.

Derangements (permutations with no fixed points) appear in “letters into wrong envelopes” questions. The number of derangements of n items, denoted !n, satisfies !n = n! Σk=0n (−1)k/k! and the recurrence !n = (n−1)(!(n−1) + !(n−2)). For small n memorise: !1=0, !2=1, !3=2, !4=9, !5=44.

Inclusion–exclusion handles multiple overlapping restrictions. Example: “Arrange the letters of ‘ENGINEERING’ so that no two E’s are adjacent and the three N’s are not all together.” Total arrangements = 11!/(3!3!2!2!). Subtract arrangements with E’s adjacent (treat EE as a block), subtract those with N’s together (treat NNN as a block), add back where both hold. The principle extends to any number of forbidden patterns.

Combinations with repetition (stars and bars) solve “number of non‑negative integer solutions to x₁+x₂+…+xr = n” = C(n+r−1, r−1). With lower bounds ai, substitute yi = xi−ai and apply the formula. Upper bounds require inclusion–exclusion or generating functions; in exams, upper bounds are usually small enough to enumerate complementary cases.

Common Constraint Patterns

  • “Vowels never together” → arrange consonants, then choose gaps for vowels.
  • “Particular persons always sit together at a round table” → block method, then (n−k)! × k! for internal order.
  • “Select a committee with at least one member from each department” → total selections minus selections missing at least one department (inclusion–exclusion).
Inclusion–Exclusion for Arrangements with Forbidden Positions
In how many ways can the letters of the word “COMPUTER” be arranged so that the vowels O, U, E never occupy the first, third, and fifth positions respectively? (Each vowel has its own forbidden position.)

Total arrangements of 8 distinct letters = 8! = 40320.

Let A = arrangements with O in position 1, B = arrangements with U in position 3, C = arrangements with E in position 5.

|A| = 7! = 5040 (fix O, permute remaining 7). Similarly |B| = |C| = 5040.

|A∩B| = 6! = 720 (fix O and U). |A∩C| = |B∩C| = 720.

|A∩B∩C| = 5! = 120 (fix all three vowels).

By inclusion–exclusion, arrangements with at least one forbidden placement = |A|+|B|+|C| − (|A∩B|+|A∩C|+|B∩C|) + |A∩B∩C| = 3×5040 − 3×720 + 120 = 15120 − 2160 + 120 = 13080.

Valid arrangements = 40320 − 13080 = 27240.

Exam‑Day Strategy for Permutation‑Combination
Identify the constraint type within 10 seconds: together → block; never together → gap method; fixed positions → reduce n; circular → (n−1)!; derangement → use !n table. Write the unrestricted total first, then apply subtraction or inclusion–exclusion. For combination with repetition, instantly recall C(n+r−1, r−1). Keep a mental list of !n up to 6 to avoid factorial expansions under time pressure.

33. Conditional Probability and Bayes' Theorem in Quantitative Reasoning

Conditional probability P(A|B) = P(A∩B)/P(B) (provided P(B)>0) is the foundation of Bayes' theorem: P(A|B) = P(B|A)P(A)/P(B). In exam questions, the sample space is often described in words — “a bag contains 4 red and 6 blue balls; two balls are drawn without replacement”. Tree diagrams clarify sequential draws: first branch for colour of first ball, second branch for colour of second ball conditional on the first. The probability of a path is the product of branch probabilities.

Typical Bayes' scenario: “A diagnostic test for a disease has 95% sensitivity (true positive rate) and 90% specificity (true negative rate). The disease prevalence is 2%. A person tests positive. What is the probability they actually have the disease?” Let D = disease, T = positive test. P(D)=0.02, P(T|D)=0.95, P(T|¬D)=0.10. P(T) = P(T|D)P(D) + P(T|¬D)P(¬D) = 0.95×0.02 + 0.10×0.98 = 0.019 + 0.098 = 0.117. Then P(D|T) = 0.95×0.02 / 0.117 ≈ 0.1624 (16.24%). The low posterior despite high sensitivity illustrates base‑rate neglect — a common examiner trap.

Questions may combine conditional probability with combinatorics: “From a deck of 52 cards, two cards are drawn without replacement. Given that at least one is an ace, find the probability that both are aces.” Let A = both aces, B = at least one ace. P(A) = C(4,2)/C(52,2) = 6/1326. P(B) = 1 − C(48,2)/C(52,2) = 1 − 1128/1326 = 198/1326. P(A|B) = (6/1326) / (198/1326) = 6/198 = 1/33.

When events are independent, P(A|B)=P(A). Recognising independence (e.g., draws with replacement, separate experiments) saves computation. Conversely, “without replacement” always creates dependence.

Quick Reference for Common Set‑ups

  • Two‑stage experiments: draw tree, multiply along branches, sum for total probability of final outcome.
  • Medical / quality‑control testing: define disease/defect as event D, test result as T; apply Bayes' formula directly.
  • “At least one” conditions: use complement (none) to find denominator.
  • Odds form of Bayes: posterior odds = prior odds × likelihood ratio.

34. Mixture and Alligation with Multiple Components and Replacement

The classic alligation rule solves “in what ratio must two ingredients at prices p₁ and p₂ be mixed to obtain a mixture at price pₘ?” The ratio is (p₂−pₘ) : (pₘ−p₁). This extends to three components by pairwise alligation or by solving the linear system: let quantities be x, y, z; then (p₁x + p₂y + p₃z)/(x+y+z) = pₘ. With one degree of freedom, infinite solutions exist; additional constraints (e.g., total quantity fixed, or one component quantity given) yield a unique answer.

Repeated replacement problems (e.g., “a container holds 40 L of milk; 4 L is removed and replaced with water, repeated 3 times”) follow the formula: final amount of original substance = initial × (1 − r/V)n, where r = volume removed each time, V = total volume, n = number of replacements. For milk‑water, the fraction of milk after n replacements = (1 − r/V)n. If the removed volume differs each step, multiply the successive factors.

When two liquids are mixed and then a portion is replaced by a third liquid, track each component separately. Example: “10 L of a 30% alcohol solution is mixed with 5 L of a 50% alcohol solution. Then 3 L of the mixture is removed and replaced with pure water. Find the final alcohol percentage.” Step 1: total alcohol = 10×0.3 + 5×0.5 = 5.5 L; total volume = 15 L → concentration = 5.5/15 = 11/30. Step 2: remove 3 L → alcohol removed = 3×(11/30) = 1.1 L; remaining alcohol = 4.4 L; volume returns to 15 L after adding water → final concentration = 4.4/15 ≈ 29.33%.

Alligation can also handle “mixing three alloys with different copper percentages to achieve a target”. Write the copper balance equation and use the method of “alligation alternate” — pair each component with the target, compute ratios, then combine. If the target lies outside the range of given percentages, the problem has no solution (examiner may ask “which of the following cannot be the resulting percentage?”).

Replacement with Changing Volumes

  • If after each replacement the total volume changes (e.g., some mixture is discarded and not fully replenished), adjust V for each step.
  • For “remove x L, add y L of another substance”, the factor for the original substance becomes (V−x)/V; the added substance accumulates additively.

35. Advanced Average and Weighted Average Techniques for Data Interpretation

The arithmetic mean is a special case of the weighted average where all weights are equal. In DI, weighted averages appear when combining groups of different sizes: overall average = (Σ ni·ai) / Σ ni. The deviation method speeds up calculation: choose a convenient assumed mean A, compute deviations di = ai − A, then overall average = A + (Σ nidi)/Σ ni. This avoids large multiplications.

Harmonic mean is the correct average for rates when distances are equal (e.g., average speed for equal distances). For two speeds v₁ and v₂ over equal distances, harmonic mean = 2v₁v₂/(v₁+v₂). For more than two equal‑distance segments, harmonic mean = n / Σ(1/vi). Weighted harmonic mean applies when distances differ: total distance / total time.

Average of averages is a common pitfall.

Practice Questions

← Logical Reasoning Decision Making →