Basic Mathematics
Learning Objectives
- Understand the fundamental concepts of Basic Mathematics
- Apply key formulas and techniques to solve problems
- Practice with exam-level questions to build speed and accuracy
1. Number System
1.1 Digits and Place Value
The decimal number system uses ten symbols, 0 through 9, called digits. Each digit in a numeral occupies a position that determines its place value, which is a power of ten. For example, in the numeral 4 732, the digit 4 stands for four thousand because it is in the thousands place (10³), the digit 7 stands for seven hundred (10²), the digit 3 stands for thirty (10¹), and the digit 2 stands for two units (10⁰). The face value of a digit is the digit itself, irrespective of its position, while the place value is the product of the face value and the positional multiplier. Understanding this distinction is essential for performing arithmetic operations, comparing magnitudes, and applying divisibility rules later in the chapter.
1.2 Classification of Numbers
Numbers are grouped into hierarchies based on their properties. Natural numbers (1, 2, 3, …) are the counting numbers used for enumeration. Whole numbers extend the natural numbers by including zero. Integers further include the negatives of natural numbers, giving the set (…, –3, –2, –1, 0, 1, 2, 3, …). Rational numbers are those that can be expressed as a fraction p/q where p and q are integers and q ≠ 0; this set includes all integers, terminating decimals, and repeating decimals. Irrational numbers cannot be written as a simple fraction; their decimal expansions are non‑terminating and non‑repeating, such as √2, π, and e. The union of rational and irrational numbers forms the real numbers, which correspond to all points on the number line. Each classification inherits the properties of the preceding ones, so every natural number is also a whole number, an integer, a rational number, and a real number.
1.3 Properties of Even, Odd, Prime, Composite, and Co‑prime Numbers
An even integer is exactly divisible by 2, ending in 0, 2, 4, 6, or 8; an odd integer leaves a remainder of 1 when divided by 2. A prime number has exactly two distinct positive divisors: 1 and itself. The first few primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. A composite number has more than two positive divisors; 1 is neither prime nor composite. Two integers are co‑prime (or relatively prime) if their highest common factor is 1, meaning they share no prime factor. For instance, 8 and 15 are co‑prime because 8 = 2³ and 15 = 3 × 5. These properties are frequently used to simplify fractions, to determine the nature of roots, and to solve problems involving divisibility and modular arithmetic.
1.4 Divisibility Rules and Their Applications
Divisibility rules provide quick tests for whether a given integer is divisible by another without performing full division. 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 number formed by its last two digits is divisible by 4; by 5 if it ends in 0 or 5; by 6 if it satisfies both the rules for 2 and 3; by 8 if the last three digits form a number divisible by 8; by 9 if the digit sum is a multiple of 9; by 10 if it ends in 0; and by 11 if 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. These rules are derived from the base‑10 representation and are invaluable for factorising large numbers, finding highest common factors, and checking the correctness of arithmetic calculations under time pressure.
| Set | Symbol | Defining Property | Examples |
|---|---|---|---|
| Natural Numbers | ℕ | Positive integers used for counting | 1, 2, 3, … |
| Whole Numbers | W | Natural numbers plus zero | 0, 1, 2, … |
| Integers | ℤ | Whole numbers and their negatives | …, –2, –1, 0, 1, 2, … |
| Rational Numbers | ℚ | Expressible as p/q with q ≠ 0 | 1/2, –3, 0.75, 0.333… |
| Irrational Numbers | ℝ ℚ | Non‑terminating, non‑repeating decimals | √2, π, e |
| Real Numbers | ℝ | All rational and irrational numbers | Any point on the number line |
2. LCM and HCF
2.1 Definitions and Fundamental Relationship
The highest common factor (HCF), also called the greatest common divisor (GCD), of two or more integers is the largest positive integer that divides each of them without leaving a remainder. The lowest common multiple (LCM) is the smallest positive integer that is a multiple of each of the given numbers. For any two positive integers a and b, the product of the numbers equals the product of their HCF and LCM: a × b = HCF(a, b) × LCM(a, b). This relationship holds because the prime factorisation of a and b can be split into common factors (which form the HCF) and the remaining factors (which combine to form the LCM). The equality provides a powerful check: if one of the three quantities is known, the other can be deduced without re‑factorising.
2.2 Methods for Finding HCF and LCM
Two standard methods are the prime factorisation method and the division method. In the prime factorisation method, each number is expressed as a product of prime powers. The HCF is obtained by taking the lowest power of each common prime factor; the LCM is obtained by taking the highest power of every prime that appears in any of the numbers. The division method (Euclidean algorithm) finds the HCF by repeatedly dividing the larger number by the smaller and replacing the larger with the remainder until the remainder becomes zero; the last non‑zero remainder is the HCF. Once the HCF is known, the LCM can be computed using the product relationship. For more than two numbers, the HCF is found pairwise, and the LCM is found by iteratively applying the two‑number LCM formula.
2.3 LCM and HCF of Fractions
When fractions are involved, the definitions adapt naturally. The LCM of fractions is the LCM of the numerators divided by the HCF of the denominators. Conversely, the HCF of fractions is the HCF of the numerators divided by the LCM of the denominators. This follows from the requirement that the LCM of fractions must be a multiple of each fraction, and the HCF must divide each fraction. For example, for 2/3 and 4/9, the LCM of numerators (2, 4) is 4, the HCF of denominators (3, 9) is 3, so the LCM of the fractions is 4/3. The HCF of numerators is 2, the LCM of denominators is 9, giving an HCF of 2/9. These rules are essential for adding, subtracting, or comparing fractions with different denominators in algebraic manipulations.
2.4 Word Problems Involving LCM and HCF
Typical word problems ask for the least time when events recur simultaneously (LCM) or the largest possible size of a tile, container, or group that can exactly divide given quantities (HCF). For instance, if three bells toll at intervals of 6, 8, and 12 minutes, they will toll together again after LCM(6, 8, 12) = 24 minutes. If a rectangular floor of dimensions 6 m × 8 m is to be covered with square tiles of the largest possible size, the side of the tile is HCF(6, 8) = 2 m. Recognising whether a problem requires a common multiple or a common divisor is the first step; the second step is to extract the relevant numbers from the narrative and apply the appropriate method.
3. Simplification
3.1 The BODMAS Rule and Its Hierarchy
Simplification of arithmetic and algebraic expressions follows a strict order of operations known by the acronym BODMAS: Brackets first, then Orders (powers and roots), followed by Division and Multiplication (from left to right), and finally Addition and Subtraction (from left to right). The hierarchy exists because operations are not all equally binding; for example, multiplication distributes over addition, so 2 + 3 × 4 must be evaluated as 2 + (3 × 4) = 14, not (2 + 3) × 4 = 20. Brackets can be nested — parentheses ( ), square brackets [ ], and curly braces { } — and the innermost bracket is resolved first. Orders include squares, cubes, square roots, cube roots, and any higher powers; they are evaluated before any multiplication or division. Adhering to this sequence eliminates ambiguity and ensures that every competent evaluator arrives at the same result.
3.2 Handling Brackets, Orders, Division, Multiplication, Addition, Subtraction
When an expression contains multiple brackets, work from the innermost outward. For instance, in 5 + [3 × (2 + 4²) ÷ 2], first evaluate the exponent 4² = 16, then the parentheses (2 + 16) = 18, then the multiplication and division inside the square brackets from left to right: 3 × 18 = 54, then 54 ÷ 2 = 27, finally the addition 5 + 27 = 32. Division and multiplication share the same precedence; they are performed in the order they appear from left to right. The same left‑to‑right rule applies to addition and subtraction. A common mistake is to perform all multiplications before any divisions, or all additions before any subtractions, which can change the result when the operations are interleaved.
3.3 Simplification of Algebraic Expressions
Algebraic simplification uses the same BODMAS hierarchy, supplemented by the laws of indices and the distributive property. Like terms — terms with the same variable raised to the same power — can be combined by adding or subtracting their coefficients. For example, 3x² + 5x² – 2x² = 6x². The distributive law a(b + c) = ab + ac allows removal of brackets: 2(x + 3) – 4(x – 1) = 2x + 6 – 4x + 4 = –2x + 10. When fractions appear, common denominators are found using LCM of the denominators, and the numerators are combined accordingly. Factorisation, the reverse of expansion, is often used to cancel common factors in rational expressions, reducing them to simplest form.
3.4 Common Errors and How to Avoid Them
Frequent errors include ignoring the left‑to‑right rule for division and multiplication, misplacing the negative sign when expanding brackets, and treating the square root of a squared variable as the variable itself rather than its absolute value (√(x²) = |x|). Another pitfall is cancelling terms across addition or subtraction incorrectly, such as (x + 2)/(x + 3) ≠ 2/3. To avoid these, always write intermediate steps, keep brackets until the operation inside is complete, and verify the result by substituting a simple numeric value for the variable. Consistent practice with varied expressions builds the automaticity needed for rapid, accurate simplification under examination conditions.
4. Mensuration
4.1 Perimeter and Area of Two‑Dimensional Figures
Mensuration deals with the measurement of geometric figures. For two‑dimensional shapes, the perimeter is the total length of the boundary, while the area is the measure of the surface enclosed. The perimeter of a rectangle with length l and breadth b is 2(l + b); its area is l × b. A square of side a has perimeter 4a and area a². The perimeter (circumference) of a circle of radius r is 2πr, and its area is πr². For a triangle with base b and height h, the area is ½ × b × h; Heron’s formula gives the area when all three sides a, b, c are known: area = √[s(s – a)(s – b)(s – c)] where s = (a + b + c)/2 is the semi‑perimeter. The area of a parallelogram is base × height, and that of a trapezium is ½ × (sum of parallel sides) × height. These formulas are derived from decomposition into simpler shapes or from integration principles, and they are the building blocks for solving composite‑figure problems.
4.2 Surface Area and Volume of Three‑Dimensional Solids
Three‑dimensional solids have surface area (the sum of areas of all faces) and volume (the space enclosed). A cube of side a has surface area 6a² and volume a³. A cuboid of dimensions l, b, h has surface area 2(lb + bh + hl) and volume l × b × h. 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 right circular cone of radius r, height h, and slant height l = √(r² + h²) 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³. A hemisphere has curved surface area 2πr², total surface area 3πr², and volume ⅔πr³. These formulas are obtained by revolving plane figures or by summation of infinitesimal elements, and they are essential for problems involving capacity, material required, and cost estimation.
4.3 Units of Measurement and Conversion
Consistent units are crucial in mensuration. Length is measured in millimetres (mm), centimetres (cm), metres (m), and kilometres (km); 1 cm = 10 mm, 1 m = 100 cm, 1 km = 1000 m. Area units are square millimetres (mm²), square centimetres (cm²), square metres (m²), hectares (ha), and square kilometres (km²); 1 m² = 10⁴ cm², 1 ha = 10⁴ m², 1 km² = 100 ha. Volume units include cubic centimetres (cm³), cubic metres (m³), litres (L), and millilitres (mL); 1 L = 1000 cm³, 1 m³ = 1000 L. When converting, the conversion factor is raised to the power corresponding to the dimension: for area, square the linear factor; for volume, cube it. For example, to convert 5 m² to cm², multiply by (100)² = 10 000, giving 50 000 cm². Errors often arise from forgetting to square or cube the factor, so always check the dimension of the quantity being converted.
4.4 Practical Problems in Mensuration
Real‑world problems combine several formulas. A typical question might ask for the cost of painting the walls of a room (surface area of four walls = 2h(l + b)) at a given rate per square metre, or the number of bricks needed to build a wall (volume of wall ÷ volume of one brick). Another common type involves melting a solid and recasting it into another shape, where the volume remains constant. For instance, a sphere of radius 6 cm is melted and drawn into a wire of diameter 0.2 cm; the length of the wire is found by equating the volume of the sphere (⁴/₃π × 6³) to the volume of the cylindrical wire (π × (0.1)² × length). Solving gives length = (⁴/₃ × 216) / 0.01 = 28 800 cm = 288 m. Such problems test the ability to identify the relevant formulas, set up the equation correctly, and handle unit conversions seamlessly.
| 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, h, l) | πr(r + l) | ⅓πr²h |
| Sphere (r) | 4πr² | ⁴/₃πr³ |
| Hemisphere (r) | 3πr² | ⅔πr³ |
5. Probability
5.1 Basic Concepts: Experiment, Outcome, Event, Sample Space
Probability quantifies the likelihood of an event occurring. A random experiment is a process that leads to well‑defined outcomes but whose result cannot be predicted with certainty, such as tossing a coin or drawing a card. The set of all possible outcomes is called the sample space, denoted by S. An event is any subset of the sample space; it may be a single outcome (elementary event) or a combination of outcomes (compound event). For a fair six‑sided die, S = {1, 2, 3, 4, 5, 6}. The event “getting an even number” is E = {2, 4, 6}. The probability of an event E, written P(E), is a number between 0 and 1 inclusive, where 0 means impossibility and 1 means certainty. The classical definition assigns equal probability to each elementary outcome when the outcomes are equally likely, giving P(E) = (number of favourable outcomes) / (total number of outcomes). This definition works for finite sample spaces with symmetry, such as coins, dice, and well‑shuffled cards.
5.2 Classical Definition and Axiomatic Approach
The classical definition assumes equally likely outcomes, but many real situations do not satisfy this. The axiomatic approach, formulated by Kolmogorov, defines probability through three axioms: (1) For any event E, 0 ≤ P(E) ≤ 1. (2) P(S) = 1. (3) For any countable sequence of mutually exclusive events E₁, E₂, …, P(E₁ ∪ E₂ ∪ …) = P(E₁) + P(E₂) + … . These axioms provide a rigorous foundation that extends to infinite sample spaces and continuous distributions. From the axioms, important properties follow: P(∅) = 0, P(Eᶜ) = 1 – P(E) where Eᶜ is the complement of E, and if A ⊆ B then P(A) ≤ P(B). The addition theorem for any two events A and B states P(A ∪ B) = P(A) + P(B) – P(A ∩ B). This corrects the double‑counting of the intersection when the events are not mutually exclusive.
5.3 Addition and Multiplication Theorems
The addition theorem is used to find the probability that at least one of two events occurs.
Modular Arithmetic and Congruence Classes
Modular arithmetic extends the familiar integer operations by introducing a modulus m (a positive integer). Two integers a and b are said to be congruent modulo m, written a ≡ b (mod m), when m divides their difference a − b. This relation partitions the set of integers into m equivalence classes, each represented by a remainder from 0 to m−1. The set of classes forms a finite ring ℤm where addition and multiplication are well defined: [a] + [b] = [a + b] and [a]·[b] = [a·b]. Important properties include the existence of additive inverses for every class and multiplicative inverses precisely for those classes coprime to m. Euler’s theorem states that if gcd(a,m)=1 then aφ(m) ≡ 1 (mod m), where φ is Euler’s totient function. Fermat’s little theorem is the special case m = p prime: ap−1 ≡ 1 (mod p). These results are the backbone of many divisibility shortcuts, cryptographic algorithms, and the solution of linear congruences ax ≡ b (mod m). A linear congruence has a solution iff gcd(a,m) divides b; when it does, there are exactly gcd(a,m) distinct solutions modulo m. The extended Euclidean algorithm simultaneously yields gcd(a,m) and the coefficients of Bézout’s identity, providing a constructive method to find the inverse of a modulo m when it exists. Mastery of modular arithmetic enables rapid evaluation of large powers, determination of last digits, and the solution of problems that would otherwise require unwieldy integer arithmetic.
Chinese Remainder Theorem and Scheduling Problems
The Chinese Remainder Theorem (CRT) gives a systematic way to solve a system of simultaneous linear congruences with pairwise coprime moduli. Given congruences x ≡ a1 (mod m1), x ≡ a2 (mod m2), …, x ≡ ak (mod mk) where gcd(mi, mj) = 1 for i ≠ j, there exists a unique solution modulo M = m1m2…mk. The constructive proof computes Mi = M / mi and the modular inverse yi of Mi modulo mi; the solution is x = Σ ai Mi yi (mod M). When moduli are not coprime, a solution exists iff each pair of congruences is compatible, i.e. ai ≡ aj (mod gcd(mi, mj)). In that case the system can be reduced to an equivalent one with coprime moduli by merging compatible equations. CRT appears frequently in scheduling: finding the first time several periodic events coincide, determining a number that leaves prescribed remainders when divided by several divisors, and constructing hash functions with low collision rates. A classic example asks for 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. Applying CRT with moduli 3, 5, 7 yields M = 105, M1=35, M2=21, M3=15; inverses are 2, 1, 1 respectively, giving x = 2·35·2 + 3·21·1 + 2·15·1 = 233 ≡ 23 (mod 105). The answer 23 satisfies all three conditions. Understanding both the coprime and non‑coprime versions of CRT equips the aspirant to tackle a wide variety of “find the number” and “find the time” questions that appear in quantitative sections.
Mensuration of Frustums, Pyramids, and Composite Solids
Beyond the standard solids, competitive examinations frequently test frustums of cones and pyramids, as well as solids formed by joining or removing basic shapes. A frustum of a right circular cone with radii R (lower base) and r (upper base) and height h has slant height l = √((R−r)² + h²). Its curved surface area is π (R + r) l, total surface area adds the areas of the two circular ends π R² + π r², and volume is ⅓ π h (R² + Rr + r²). For a frustum of a square pyramid with side lengths a (lower) and b (upper) and height h, the volume is ⅓ h (a² + ab + b²) and the lateral area is the sum of four trapezoidal faces. Composite solids are handled by the principle of additivity: the volume of a solid formed by joining two non‑overlapping solids equals the sum of their volumes; the surface area equals the sum of their exposed surfaces, subtracting the area of any interface that becomes internal. A typical problem: a solid cylinder of radius 5 cm and height 12 cm has a conical cavity of the same base radius and height drilled through its axis. The remaining volume is cylinder volume minus cone volume = π·5²·12 − ⅓ π·5²·12 = ⅔ π·5²·12 = 200π cm³. The total surface area includes the outer curved surface of the cylinder, the inner curved surface of the cone, and the top circular face of the cylinder (the base of the cone is removed). Careful identification of which faces are exposed avoids double‑counting. Another common variant involves melting a solid and recasting it into a different shape while conserving volume; equating the volume expressions yields the unknown dimension. Mastery of these formulas and the additivity principle enables rapid solution of multi‑step mensuration questions.
Conditional Probability, Bayes' Theorem, and Independence
Conditional probability quantifies how the likelihood of an event changes when another event is known to have occurred. For events A and B with P(B) > 0, the conditional probability of A given B is P(A|B) = P(A ∩ B) / P(B). The multiplication rule follows: P(A ∩ B) = P(A|B) P(B) = P(B|A) P(A). Events A and B are independent iff P(A ∩ B) = P(A) P(B), equivalently P(A|B) = P(A) and P(B|A) = P(B). Bayes’ theorem inverts conditional probabilities: P(A|B) = P(B|A) P(A) / P(B). When the sample space is partitioned into mutually exclusive and exhaustive events E₁, E₂, …, Eₙ, the law of total probability gives P(B) = Σ P(B|Eᵢ) P(Eᵢ), and Bayes’ theorem becomes P(Eᵢ|B) = P(B|Eᵢ) P(Eᵢ) / Σ P(B|Eⱼ) P(Eⱼ). This framework underlies medical testing problems (sensitivity, specificity, prevalence), spam filtering, and reliability analysis. A classic illustration: a disease affects 1 % of a population; a test has 99 % sensitivity (true positive rate) and 95 % specificity (true negative rate). The probability that a person who tests positive actually has the disease is P(D|+) = (0.99 × 0.01) / (0.99 × 0.01 + 0.05 × 0.99) ≈ 0.167. Despite high test accuracy, the low prevalence makes a positive result only about 16.7 % reliable. Recognising the base‑rate fallacy and correctly applying Bayes’ theorem are essential for avoiding the most common probability traps in examinations.
Counting Techniques: Permutations, Combinations, and the Inclusion–Exclusion Principle
Counting the number of favourable outcomes is often the first step in probability problems. A permutation of n distinct objects taken r at a time is an ordered arrangement; its count is ⁿPᵣ = n! / (n−r)!. A combination disregards order: ⁿCᵣ = n! / (r! (n−r)!). When objects are not all distinct, the number of distinct permutations of a multiset with frequencies n₁, n₂, …, nₖ (Σ nᵢ = n) is n! / (n₁! n₂! … nₖ!). Circular permutations of n distinct objects equal (n−1)! because rotations are considered identical. The inclusion–exclusion principle extends counting to unions of overlapping sets: for two sets A and B, |A ∪ B| = |A| + |B| − |A ∩ B|; for three sets, |A ∪ B ∪ C| = Σ|A| − Σ|A ∩ B| + |A ∩ B ∩ C|. This principle is indispensable for problems such as “how many integers from 1 to 1000 are divisible by 2, 3, or 5?” where direct counting would double‑count multiples of 6, 10, 15, etc. The general formula for n sets alternates sums of intersections of odd and even cardinalities. Another powerful tool is the stars‑and‑bars method for distributing identical objects into distinct boxes: the number of non‑negative integer solutions to x₁ + x₂ + … + xₖ = n is ⁿ⁺ᵏ⁻¹Cₖ₋₁. When each box must receive at least one object, substitute yᵢ = xᵢ − 1 to obtain ⁿ⁻¹Cₖ₋₁. These combinatorial techniques, combined with the probability axioms, allow the aspirant to construct sample spaces for complex experiments such as drawing cards with replacement, forming committees with constraints, or arranging letters with repeated characters.
- Assuming moduli are coprime without checking; the CRT formula fails if any pair shares a factor.
- Forgetting to subtract the internal interface area when computing surface area of composite solids.
- Confusing conditional probability P(A|B) with the joint probability P(A ∩ B) or the reverse conditional P(B|A).
- Applying Bayes’ theorem without first verifying that the partitioning events are mutually exclusive and exhaustive.
- Treating permutations as combinations (or vice‑versa) when order matters in the problem statement.
- Neglecting the base‑rate (prior probability) in diagnostic‑test style questions, leading to the base‑rate fallacy.
- Misapplying stars‑and‑bars when objects are distinct or when boxes have capacity limits.
These advanced topics complete the quantitative toolkit for competitive examinations.