Back to Mathematics Hub
#4 Compulsory Number System & Arithmetic Math 4

LCM & HCF: Factorization, Division & Applicationsल०स० एवं म०स०: गुणनखण्ड, भाग विधि एवं अनुप्रयोग

Mastery of Lowest Common Multiple (LCM) and Highest Common Factor (HCF) through prime factorization, division algorithms, fraction analysis, and real-world periodic event applications. High examination weightage in UP Super TET Junior Part 2C for testing analytical problem-solving speed under -1 negative marking constraints.

Preparation Status

Mark complete once covered. Progress syncs automatically with the main syllabus hub.

Syllabus Focus & High-Yield Strategy: Mastery of Lowest Common Multiple (LCM) and Highest Common Factor (HCF) through prime factorization, division algorithms, fraction analysis, and real-world periodic event applications. High examination weightage in UP Super TET Junior Part 2C for testing analytical problem-solving speed under -1 negative marking constraints.

1. Fundamental Axioms, Definitions & Foundational Properties

Definition of Factor and Multiple: A factor of a given natural number $N$ is an exact divisor of $N$, meaning it divides $N$ leaving a remainder of zero. Conversely, a multiple of $N$ is any number formed by the product of $N$ and an integer $k in mathbb{Z}^+$.
Highest Common Factor (HCF): Also known as the Greatest Common Divisor (GCD) or Greatest Common Measure (GCM), the HCF of two or more non-zero integers is the largest positive integer that divides each of the integers without leaving a remainder. For integers $a$ and $b$, $ ext{HCF}(a, b) le min(|a|, |b|)$.
Lowest Common Multiple (LCM): The LCM of two or more non-zero integers is the smallest positive integer that is a multiple of each of the given integers. For non-zero integers $a$ and $b$, $ ext{LCM}(a, b) ge max(|a|, |b|)$.
Fundamental Theorem of Arithmetic: Every integer greater than $1$ either is a prime number itself or can be represented as a unique product of prime numbers, apart from the order of the prime factors: $N = p_1^{a_1} p_2^{a_2} cdots p_k^{a_k}$.
Exam Pro-Tip: When dealing with large numbers in Super TET, always convert numbers into their canonical prime factorization form before attempting to find LCM or HCF.
Memory Mnemonic: HPL — Highest uses Powers Least (for HCF, take lowest exponent of common primes); Lowest uses Powers Largest (for LCM, take highest exponent of all primes).

2. Formulas, Standard Theorems & Algorithmic Procedures

Category / CaseFormula / Mathematical RuleTopper Calculation Shortcut
Two Numbers Product$ ext{HCF}(a,b) imes ext{LCM}(a,b) = a imes b$Find HCF first via division, then divide product $(a imes b)$ by HCF to get LCM instantly.
Fractions HCF & LCM$ ext{HCF}left( rac{a}{b}, rac{c}{d} ight) = rac{ ext{HCF}(a, c)}{ ext{LCM}(b, d)}$Numerator operation matches the outer function name (HCF numerator, LCM denominator).
Fractions LCM & HCF$ ext{LCM}left( rac{a}{b}, rac{c}{d} ight) = rac{ ext{LCM}(a, c)}{ ext{HCF}(b, d)}$Denominator operation is always the opposite of the outer function.
Decimal NumbersConvert all decimals to like fractions by appending zeros, compute HCF/LCM, then adjust decimal point.Count maximum decimal places $k$, multiply by $10^k$, compute, and divide final result by $10^k$.
Prime Factorization Algorithm for HCF: Express each number as a product of prime powers. The HCF is the product of the lowest powers of common prime factors present in all given numbers.
Prime Factorization Algorithm for LCM: Express each number as a product of prime powers. The LCM is the product of the highest powers of all prime factors appearing in any of the numbers.
Division Algorithm (Euclidean Method for HCF): To find $ ext{HCF}(A, B)$ where $A > B$, divide $A$ by $B$ to get quotient $q_1$ and remainder $r_1$. Divide $B$ by $r_1$ to get $q_2$ and remainder $r_2$. Repeat until remainder is zero. The last non-zero divisor is the HCF.
15-Second Speed-Math Trick: If all given numbers are prime to each other (coprime in pairs), their HCF is always $1$ and their LCM is simply the direct algebraic product of the numbers: $ ext{LCM} = x imes y imes z$.

3. Word Problem Modeling & Practical Applications

Periodic Event Synchronization Problems: When multiple traffic lights, bells, runners on a circular track, or flashing beacons start simultaneously and repeat at fixed intervals $t_1, t_2, t_3$ seconds, they will chime or meet together again at a time equal to $ ext{LCM}(t_1, t_2, t_3)$.
Division into Equal Containers / Maximum Size Problems: When asked to find the largest possible length, weight, or capacity that can measure different quantities an exact number of times, calculate the $ ext{HCF}$ of the given quantities. (Keywords: 'maximum', 'greatest', 'largest', 'longest').
Remainder-Based Word Problems: If a number $N$ leaves remainders $r_1, r_2, r_3$ when divided by divisors $d_1, d_2, d_3$ respectively such that $(d_1 - r_1) = (d_2 - r_2) = (d_3 - r_3) = k$, then the required number is $ ext{LCM}(d_1, d_2, d_3) - k$.
Arrangement in Rows/Columns Problems: When flowers, soldiers, or students are to be arranged in rows of equal size containing $x, y,$ or $z$ persons with no remainder, find $ ext{LCM}(x, y, z)$. If a specific remainder $r$ is left each time, add $r$ to the LCM.
UP Exam High-Yield Tip: Read word problems carefully for phrases like 'least number which when divided by...' (signals LCM) versus 'greatest number that will divide... leaving remainder $r$' (signals HCF of numbers minus $r$).

4. Mathematical Edge Cases, Sign Conventions & Common Traps

Critical Distinction on Negative Integers: By standard algebraic convention in elementary arithmetic, HCF and LCM are defined for positive integers ($mathbb{Z}^+$). When negative numbers appear, absolute values are taken: $ ext{HCF}(-a, b) = ext{HCF}(a, b)$.
Edge Case with Zero: Zero is a multiple of every integer because $n imes 0 = 0$. However, division by zero is undefined. Therefore, $ ext{HCF}(a, 0) = |a|$ for $a eq 0$, but $ ext{HCF}(0, 0)$ is undefined in standard elementary arithmetic.
Common Calculation Trap in HCF of Fractions: Students often mistakenly apply LCM to numerators and HCF to denominators when evaluating fraction HCF. Always verify numerator-denominator alignment using dimensional analysis.
Trap Prevention Trick: When solving remainder problems where numbers leave a constant remainder $r$, remember to subtract $r$ *before* finding HCF, but add $r$ *after* finding LCM. Never mix up the operations!
Memory Mnemonic: SALI — Subtract After LCM is found (for remainder problems where remainder is added at the end); Subtract Before HCF (for remainder problems where remainder is subtracted first).

Comprehensive Mathematical Matrix & Method Comparison

Parameter / DimensionMethod / Concept AMethod / Concept BExam Speed & Accuracy Takeaway
Prime Factorization vs DivisionPrime Factorization: Best for small numbers (< 1000) and algebraic expressions.Division Method (Euclidean): Best for large numbers and successive remainders.Use Prime Factorization for algebraic/variable terms; use Division for large numerical values.
HCF Calculation PropertiesHCF of two numbers divides their sum, difference, and LCM.HCF is never greater than the smaller of the two numbers.Use difference method: $ ext{HCF}(a, b) = ext{HCF}(a, b-a)$ to quickly reduce large numbers.
LCM Calculation PropertiesLCM of two coprime numbers is their direct product.LCM is always a multiple of the HCF of those numbers.Always check if smaller number divides larger number; if yes, larger number is LCM.
Application ContextsHCF: Partitioning, measuring, maximum capacity, highest common divisor.LCM: Synchronization, periodic recurrence, simultaneous bells, circular tracks.Match keywords in question stem ('greatest' $ o$ HCF, 'least/together' $ o$ LCM) instantly.
Practice Progress: 0 of 10 Answered
Score: 0 / 10
Question 1 of 10 Super TET Junior Mathematics

1. What is the HCF of two numbers whose LCM is $2310$ and product is $48510$?

Correct Answer: Option B

Using the standard property relating HCF, LCM, and product of two numbers: $ ext{HCF}(a, b) imes ext{LCM}(a, b) = a imes b$. Substituting the given values: $ ext{HCF} imes 2310 = 48510$. Therefore, $ ext{HCF} = rac{48510}{2310} = rac{4851}{231} = 21$. Distractors like $11$ or $42$ arise from incorrect division or arithmetic calculation errors.

Question 2 of 10 Super TET Junior Mathematics

2. Find the greatest number that divides 414, 751, and 1014, leaving remainders 7, 11, and 15, respectively.

Correct Answer: Option B

Subtract each remainder: 414-7=407=11 x 37, 751-11=740=20 x 37, and 1014-15=999=27 x 37. Since gcd(11,20,27)=1, the greatest common divisor is 37. The answer is Option B.

Question 3 of 10 Super TET Junior Mathematics

3. The LCM of two numbers is $12$ times their HCF. The sum of LCM and HCF is $403$. If one number is $93$, what is the other number?

Correct Answer: Option A

Let HCF be $H$ and LCM be $L$. Given $L = 12H$ and $L + H = 403$. Substituting $L$: $12H + H = 403 implies 13H = 403 implies H = rac{403}{13} = 31$. Thus, $L = 12 imes 31 = 372$. Using the product formula: $a imes b = H imes L implies 93 imes b = 31 imes 372$. Solving for $b$: $b = rac{31 imes 372}{93} = rac{372}{3} = 124$. Distractors like $134$ or $144$ result from arithmetic division errors.

Question 4 of 10 Super TET Junior Mathematics

4. Three alarm clocks ring at intervals of $10$, $15$, and $20$ minutes respectively. If they ring together at $10:00 ext{ AM}$, at what time will they next ring together?

Correct Answer: Option B

To find when the clocks ring together again, we calculate the LCM of the intervals: $ ext{LCM}(10, 15, 20)$. Prime factorization: $10 = 2 imes 5$, $15 = 3 imes 5$, $20 = 2^2 imes 5$. Taking highest powers of all primes: $ ext{LCM} = 2^2 imes 3 imes 5 = 4 imes 3 imes 5 = 60 ext{ minutes}$ (or $1 ext{ hour}$). Adding $1 ext{ hour}$ to $10:00 ext{ AM}$ gives $11:00 ext{ AM}$. Distractors like $10:30 ext{ AM}$ or $11:30 ext{ AM}$ arise from incorrect LCM calculation.

Question 5 of 10 Super TET Junior Mathematics

5. What is the LCM of $\frac{2}{3}, \frac{4}{9},$ and $\frac{5}{6}$?

Correct Answer: Option B

The formula for the LCM of fractions is $ ext{LCM}left( rac{a}{b}, rac{c}{d}, rac{e}{f} ight) = rac{ ext{LCM}(a, c, e)}{ ext{HCF}(b, d, f)}$. Numerators are $2, 4, 5$; $ ext{LCM}(2, 4, 5) = 20$. Denominators are $3, 9, 6$; $ ext{HCF}(3, 9, 6) = 3$. Therefore, $ ext{LCM} = rac{20}{3}$. Distractors like $ rac{10}{3}$ or $ rac{20}{9}$ result from swapping numerator and denominator operations.

Question 6 of 10 Super TET Junior Mathematics

6. Find the least number which when divided by $12, 16,$ and $24$ leaves a remainder $7$ in each case.

Correct Answer: Option B

First, find the LCM of the divisors $12, 16,$ and $24$. Prime factorization: $12 = 2^2 imes 3$, $16 = 2^4$, $24 = 2^3 imes 3$. $ ext{LCM}(12, 16, 24) = 2^4 imes 3 = 16 imes 3 = 48$. Since the number leaves a constant remainder $7$ in each case, we add the remainder to the LCM: $48 + 7 = 55$. Testing $55$: $55 div 12 = 4$ remainder $7$; $55 div 16 = 3$ remainder $7$; $55 div 24 = 2$ remainder $7$. Distractor $47$ is obtained by subtracting instead of adding.

Question 7 of 10 Super TET Junior Mathematics

7. The ratio of two numbers is $3:4$ and their HCF is $5$. What is their LCM?

Correct Answer: Option B

Let the two numbers be $3x$ and $4x$. Since their ratio is in simplest form, their HCF is $x$. Given $ ext{HCF} = 5$, the numbers are $3 imes 5 = 15$ and $4 imes 5 = 20$. The LCM of two numbers is given by $ ext{HCF} imes ext{ratio}_1 imes ext{ratio}_2 = 5 imes 3 imes 4 = 60$. Alternatively, $ ext{LCM} = rac{15 imes 20}{ ext{HCF}(15, 20)} = rac{300}{5} = 60$. Distractor $45$ or $75$ arises from incorrect multiplication.

Question 8 of 10 Super TET Junior Mathematics

8. What is the HCF of $0.63, 1.05,$ and $2.1$?

Correct Answer: Option B

Make all numbers have the same number of decimal places: $0.63, 1.05, 2.10$. Consider the integers formed by removing the decimal points: $63, 105, 210$. Find the HCF of $63, 105, 210$. Prime factorization: $63 = 3^2 imes 7$, $105 = 3 imes 5 imes 7$, $210 = 2 imes 3 imes 5 imes 7$. Common prime factors with lowest powers are $3^1 imes 7^1 = 21$. Since numbers had two decimal places, divide by $100$: $ rac{21}{100} = 0.21$. Distractor $0.07$ is obtained by taking the wrong common factor ($7$ only).

Question 9 of 10 Super TET Junior Mathematics

9. Find the greatest four-digit number which is exactly divisible by $15, 21,$ and $36$.

Correct Answer: Option A

The LCM of 15, 21, and 36 is 2^2 x 3^2 x 5 x 7 = 1260. The greatest four-digit multiple is 1260 x 7 = 8820; the next multiple is five digits. The answer is Option A.

Question 10 of 10 Super TET Junior Mathematics

10. The sum of two numbers is $216$ and their HCF is $27$. How many such pairs of numbers can be formed?

Correct Answer: Option B

Let the two numbers be $27a$ and $27b$, where $a$ and $b$ are coprime integers ($ ext{HCF}(a, b) = 1$). Given their sum is $216$: $27a + 27b = 216 implies 27(a + b) = 216 implies a + b = rac{216}{27} = 8$. We need to find pairs of coprime integers whose sum is $8$. Possible pairs for $(a, b)$: $(1, 7)$ and $(3, 5)$. (Note: $(2, 6)$ and $(4, 4)$ are not coprime since their HCF is greater than $1$). Thus, exactly $2$ such pairs can be formed: $(27 imes 1, 27 imes 7) = (27, 189)$ and $(27 imes 3, 27 imes 5) = (81, 135)$. Distractors like $3$ or $4$ arise from including non-coprime pairs.

5-Minute Exam Simulation Mode

Experience the real pressure of Super TET Junior (Part 2C Mathematics). You will face 10 randomized speed-math questions with negative marking (-1 for incorrect answers) and a strict 5-minute countdown.

Time Limit:

5 Minutes (300s)

Marking Scheme:

+3 Marks | -1 Negative

Passing Benchmark:

21+ Marks (70%)

High-Yield Rapid Recall Formulas & Laws (Must-Remember Pointers)

#1
Product Property: For any two positive integers $a$ and $b$, $ ext{HCF}(a, b) imes ext{LCM}(a, b) = a imes b$.
#2
Fraction Rule: $ ext{HCF}left( rac{a}{b}, rac{c}{d} ight) = rac{ ext{HCF}(a, c)}{ ext{LCM}(b, d)}$ and $ ext{LCM}left( rac{a}{b}, rac{c}{d} ight) = rac{ ext{LCM}(a, c)}{ ext{HCF}(b, d)}$.
#3
Coprime Property: If $a$ and $b$ are coprime (relative primes), $ ext{HCF}(a, b) = 1$ and $ ext{LCM}(a, b) = a imes b$.
#4
Divisibility Rule: The HCF of two numbers always divides their sum, difference, and their LCM exactly.
#5
Multiple Property: If number $A$ is a multiple of number $B$ ($A = k cdot B$), then $ ext{HCF}(A, B) = B$ and $ ext{LCM}(A, B) = A$.
#6
Remainder Addition Rule: The least number leaving a constant remainder $r$ when divided by $d_1, d_2, d_3$ is $ ext{LCM}(d_1, d_2, d_3) + r$.
#7
Remainder Subtraction Rule: The greatest number dividing $N_1, N_2, N_3$ leaving remainders $r_1, r_2, r_3$ is $ ext{HCF}(N_1 - r_1, N_2 - r_2, N_3 - r_3)$.
#8
Euclidean Algorithm: Successive division remainder method yields the HCF of large integers rapidly without full prime factorization.

Speed Math & Memory Mnemonics Vault (Exam Retention Anchors)

HCF & LCM Power Selection Rule

Memory Key: HPL-LPL

H - Highest Common factor uses Powers Least; L - Lowest Common Multiple uses Powers Largest.

Remainder Word Problem Strategy

Memory Key: LARS

L - LCM Add remainder at end; S - Subtract remainder before finding HCF.

Negative Marking Traps & Common Blunders (-1 Penalty Avoidance)

Negative Marking Alert #1:

Negative Marking Trap 1: Confusing HCF and LCM formulas for fractions (applying LCM to numerator when question asks for HCF).

Negative Marking Alert #2:

Negative Marking Trap 2: Failing to check if generated pairs of numbers are coprime when solving sum/HCF ratio problems.

Negative Marking Alert #3:

Negative Marking Trap 3: Adding the remainder *before* calculating LCM instead of adding it *after* the LCM calculation.

Negative Marking Alert #4:

Negative Marking Trap 4: Forgetting to adjust decimal place values when calculating HCF or LCM of decimal numbers.

Self-Assessment Checklist

Previous: BODMAS Rule & Bracket Simplifica... Next: Rational Numbers: Properties, De...