Official Syllabus Item: 2 Arithmetic & Number Theory

Highest Common Factor (HCF) & Lowest Common Multiple (LCM)

Complete masterclass on HCF & LCM for RIMC Stage-I descriptive exam: prime factorization, continuous division, fractions, bell tolling, and remainder word problems.

Overview & Fundamental Concept

HCF (Greatest Common Divisor) and LCM are foundational in RIMC Stage-I descriptive mathematics. Questions range from prime factorization and Euclid's continuous division ladder to high-value 10-mark multi-step word problems involving circular tracks, simultaneous bell tolls, minimum tiles for rectangular courtyards, fractional calculations, and remainder offset theorems.

Key Theoretical Principles
  • HCF of given numbers is never greater than the smallest number.
  • LCM of given numbers is never less than the greatest number.
  • The product rule Product = HCF × LCM applies strictly to TWO numbers only.
  • Fractions must be in simplest reduced form before applying fractional HCF/LCM formulas.
  • In bell problems, the count of simultaneous tolls includes the starting toll at t = 0 (+1).
Illustrated Conceptual Diagrams & Visual Schematics
HCF & LCM Prime Intersection Venn Diagram & Product Law
HCF & LCM of 72 and 120 via Prime Factor Venn Architecture Factors of 72 Factors of 120 3 2 2 2 3 5 Calculation Summary HCF (Intersection): 2 × 2 × 2 × 3 = 24 LCM (Full Union): 2³ × 3² × 5 = 360 Golden RIMC Identity: A × B = HCF × LCM 72 × 120 = 24 × 360 (8,640 = 8,640) ✔
Fundamental Law: For any two numbers $A$ and $B$, $\text{HCF}(A, B) \times \text{LCM}(A, B) = A \times B$. In the Venn diagram, $\text{HCF}$ is the product of common prime factors (intersection), while $\text{LCM}$ is the product of all prime factors (union).

Topper Strategy & Descriptive Step Breakdown

Mastering RIMC Mathematics Standard

Begin every word problem by stating why HCF or LCM is applied. Convert all measurements to uniform units (e.g. all cm or all seconds) before calculating. Conclude with a complete boxed statement specifying units.

Step 1: Given Information & Variable Declaration (1-2 Marks)

Clearly write down the data provided in the question. State any assumption (e.g., 'Let the cost price be ₹ x').

Step 2: Formula & Conceptual Foundation (1-2 Marks)

State the exact mathematical theorem or formula in standard algebraic notation before entering numeric values.

Step 3: Systematic Calculation & Reduction (2-4 Marks)

Carry out each step on a fresh line. Avoid combining three operations in one step so examiners can award partial credit.

Step 4: Final Statement with Proper Units (1 Mark)

End with a concluding statement highlighting the answer in a neat box or underline with explicit units (e.g., '₹ 1,500', '45 km/h').

Key Formulas & Conversion Cheat Sheet

Product Relation (2 Numbers)
$$a \times b = \text{HCF}(a, b) \times \text{LCM}(a, b)$$
HCF of Fractions
$$\text{HCF} = \frac{\text{HCF of Numerators}}{\text{LCM of Denominators}}$$
LCM of Fractions
$$\text{LCM} = \frac{\text{LCM of Numerators}}{\text{HCF of Denominators}}$$
Floor Tiling (Least Tiles)
$$\text{Tiles} = \frac{L \times B}{[\text{HCF}(L, B)]^2}$$
Simultaneous Tolls in Time T
$$\text{Total Tolls} = \left\lfloor \frac{T}{\text{LCM}} \right\rfloor + 1$$
Solved Model Examples (Descriptive Format with Step Mark Distribution)
Solved Model 1 Model Solution
Find the HCF of 1365, 1560, and 1755 using Euclid's continuous division method.
Step-by-Step Model Solution:
Step 1: Divide 1560 by 1365: 1560 = 1365 × 1 + 195. Then 1365 = 195 × 7 + 0 => HCF(1365, 1560) = 195.\nStep 2: Test 195 with 1755: 1755 = 195 × 9 + 0 => HCF(195, 1755) = 195.\nFinal Answer: HCF(1365, 1560, 1755) = 195.
Solved Model 2 Model Solution
Find the greatest number which divides 1305, 4665, and 6905 leaving the same remainder in each case, and find the remainder.
Step-by-Step Model Solution:
Step 1: Pairwise differences: 4665 - 1305 = 3360, 6905 - 4665 = 2240, 6905 - 1305 = 5600.\nStep 2: HCF(3360, 2240) = 1120. HCF(1120, 5600) = 1120.\nStep 3: Common remainder: 1305 = 1120 × 1 + 185.\nFinal Answer: Required number is 1120 and common remainder is 185.
Solved Model 3 Model Solution
Six bells toll together at intervals of 2, 4, 6, 8, 10, 12 seconds. In 30 minutes, how many times do they toll together?
Step-by-Step Model Solution:
Step 1: LCM(2, 4, 6, 8, 10, 12) = 120 seconds = 2 minutes.\nStep 2: In 30 minutes, number of intervals = 30 / 2 = 15.\nStep 3: Including the starting toll at t = 0: 15 + 1 = 16.\nFinal Answer: They toll together 16 times.

RIMC Practice & Drill Exercises

Attempt these questions on paper following proper step-wise conventions, then click Reveal Solution to verify your answers.

Question 1 5 Marks
Two numbers are in the ratio 15 : 11. If their HCF is 13, find the two numbers and their LCM.
Model Descriptive Solution:
Numbers are 15 × 13 = 195 and 11 × 13 = 143. LCM = 13 × 15 × 11 = 2145.
Question 2 5 Marks
The HCF of two numbers is 16 and their product is 3072. Find their LCM.
Model Descriptive Solution:
LCM = Product / HCF = 3072 / 16 = 192.
Question 3 5 Marks
Find the maximum capacity of a container that measures petrol of 403 L, 434 L, and 465 L tankers an exact number of times.
Model Descriptive Solution:
HCF(403, 434, 465) = 31 litres.
Question 4 5 Marks
Find the least 5-digit number exactly divisible by 16, 24, 36, and 54.
Model Descriptive Solution:
LCM(16, 24, 36, 54) = 432. Smallest 5-digit number is 10000. 10000 ÷ 432 = 23 remainder 64. Required number = 10000 + (432 - 64) = 10368.
Question 5 5 Marks
Can two numbers have 15 as their HCF and 175 as their LCM? Give reasons.
Model Descriptive Solution:
No, because HCF must be an exact divisor of LCM. 175 ÷ 15 leaves remainder 10.
Question 6 10 Marks
Find the greatest number that will divide 398, 436, and 542 leaving remainders 7, 11, and 15 respectively.
Model Descriptive Solution:
HCF(398-7, 436-11, 542-15) = HCF(391, 425, 527) = 17.
Question 7 10 Marks
Three persons walk around a 1200 m circular track at 50, 60, and 75 m/min. When will they meet at the starting point?
Model Descriptive Solution:
Lap times: 1200/50 = 24 min, 1200/60 = 20 min, 1200/75 = 16 min. LCM(24, 20, 16) = 240 min = 4 hours.
Question 8 10 Marks
Find the smallest number which when increased by 17 is divisible by both 520 and 468.
Model Descriptive Solution:
LCM(520, 468) = 4680. Required number = 4680 - 17 = 4663.
Question 9 10 Marks
Find the largest 4-digit number which when divided by 12, 15, 18, and 27 leaves remainders 8, 11, 14, and 23 respectively.
Model Descriptive Solution:
Common difference k = 4. LCM(12, 15, 18, 27) = 540. Largest 4-digit multiple = 9720. Required number = 9720 - 4 = 9716.
Question 10 10 Marks
The HCF and LCM of two numbers are 21 and 4641. If one number lies between 200 and 300, find both numbers.
Model Descriptive Solution:
Product of coprime factors xy = 4641 / 21 = 221 = 13 × 17. Numbers are 21 × 13 = 273 and 21 × 17 = 357 (273 lies between 200 and 300).

High-Yield FAQs & Revision Notes

Can the HCF of two numbers ever be greater than their LCM?
No. HCF is always a factor of LCM, so HCF <= LCM. They are equal only if the numbers are equal.
Does the formula Product = HCF × LCM apply to three or more numbers?
No. The identity holds strictly for two numbers only. For three numbers, a × b × c != HCF × LCM.
What is the rule for finding HCF and LCM of fractions?
Reduce fractions to simplest form first. HCF = (HCF of numerators) / (LCM of denominators); LCM = (LCM of numerators) / (HCF of denominators).
How do you find the greatest number that divides x, y, and z leaving remainders a, b, and c?
Subtract the remainders first: HCF(x - a, y - b, z - c).
How do you solve problems where the same unknown remainder is left in each case?
Compute the HCF of the pairwise positive differences: HCF(|x - y|, |y - z|, |z - x|).
Why do bell tolling problems require adding 1 when finding the count of simultaneous tolls?
Because the bells toll together at starting time t = 0 as well as at each LCM interval: (T / LCM) + 1.
How do you find the least number which leaves remainders r1, r2, r3 when divided by d1, d2, d3 with constant difference k?
If d - r = k is constant, Required Number = LCM(d1, d2, d3) - k.
What is the minimum number of square tiles needed to pave a rectangular courtyard?
Tile side = HCF(Length, Breadth). Least number of tiles = (Length × Breadth) / [HCF(Length, Breadth)]^2.
What is the HCF and LCM of two co-prime numbers?
For co-primes a and b: HCF = 1, and LCM = a × b.
How does this module map to the official RIMC syllabus?
It directly fulfills Serial No. 2 of Chapter 8 in the official RIMC brochure.
How does this topic relate to the official RIMC syllabus?
This module directly covers Serial No. 2 of the broader syllabus published in Chapter 8 of the official RIMC admission brochure, ensuring 100% syllabus alignment.