HCF LCM for Non-Integers for UPSC CSAT

1. Theoretical Foundation & Mathematical Underpinnings

Formal Definition & Scope

For integers, divisibility is absolute. For rationals, we must extend the definition appropriately.

• Divisibility for Rationals: A rational number r₁ divides r₂ if and only if:

  ^r₂/_r1 ∈ ℤ

  i.e., r₂ is an integer multiple of r₁.

• HCF of Fractions/Decimals (H_f): The largest positive rational H_f such that H_f divides each given number. Hence:

  H_f ≤ min(r₁, r₂, …, r_n)

• LCM of Fractions/Decimals (L_f): The smallest positive rational L_f such that each given number divides L_f. Hence:

  L_f ≥ max(r₁, r₂, …, r_n)

• Domain Constraint: We operate strictly with fractions in the form:

  r_i = ^p_i/_qi,   p_i, q_i ∈ ℤ⁺,   q_i ≠ 0,   gcd(p_i, q_i) = 1

  and for decimals:

  r_i = ^N_i/_10^k,   N_i ∈ ℤ⁺,   k ∈ ℤ_{≥ 0}

Absolute Pre-condition: A fraction is not merely an isolated pair of integers (p, q); it represents a rational equivalence class. For example, ²/₄ = ¹/₂ represents the same value. All HCF/LCM formulas are valid only when fractions are expressed in their canonical lowest terms where gcd(p_i, q_i) = 1. Computing on unreduced fractions silently inflates denominators or numerators with common factors, corrupting the result.

The “Why” Behind the Math

Why is LCM of fractions = ^{LCM of Numerators}/_{HCF of Denominators}?

Proof Sketch:
Let S = {^p₁/_q1, ^p₂/_q2} be a set of fractions reduced to lowest terms. Define:

L = ^L_n/_Hd   where   L_n = LCM(p₁, p₂),   H_d = HCF(q₁, q₂)

For L to be a common multiple, we require ^L/_(pi/qi) ∈ ℤ for each i. Evaluating for i = 1:

^L/_(p1/q1) = (^L_n/_Hd) · (^q₁/_p1) = (^L_n/_p1) × (^q₁/_Hd)

• By definition, p₁ | L_n, so ^L_n/_p1 ∈ ℤ.
• By definition, H_d | q₁, so ^q₁/_Hd ∈ ℤ.

The product of two integers is always an integer; hence, L is a valid common multiple.

To guarantee that L is the least common multiple:

1. The numerator must be minimized while remaining divisible by every p_i ⇒ LCM(p_i).
2. The denominator must be maximized while dividing every q_i ⇒ HCF(q_i) (maximizing the denominator minimizes the overall fraction value).

The dual logic applies to the HCF:

• LCM seeks a large value: Numerator is maximized (LCM) and denominator is minimized (HCF of denominators maximizes total fractional magnitude).
• HCF seeks a small value: Numerator is minimized (HCF) and denominator is maximized (LCM of denominators minimizes total fractional magnitude).

Hence, for any set in lowest terms:

L_f = ^LCM(p_i)/_HCF(qi),      H_f = ^HCF(p_i)/_LCM(qi)

Why Must Fractions Be Reduced?

The formula relies on the denominator q being strictly coprime to p. If unreduced, an uncancelled factor gcd(p, q) > 1 distorts the least common multiple or highest common factor.

Example: Consider ²/₄ unreduced (true value ¹/₂) and ³/₅.

Using unreduced terms:

LCM(²/₄, ³/₅)_unreduced = ^{LCM(2, 3)}/_{HCF(4, 5)} = ⁶/₁ = 6

However, 6 is not the least common multiple. The integer 3 is also a common multiple:

³/_(1/2) = 6 ∈ ℤ,      ³/_(3/5) = 5 ∈ ℤ

Since 3 < 6, 6 fails minimality. Reducing the set to {¹/₂, ³/₅} yields:

L_f = ^{LCM(1, 3)}/_{HCF(2, 5)} = ³/₁ = 3

The unreduced formula caused an error factor of gcd(2, 4) = 2.

Why Decimal Equalization Works (Scaling Invariance)

Let d₁ = 0.6 and d₂ = 0.12. The maximum number of decimal places is k = max(1, 2) = 2.

Express both numbers with a uniform base scale of 10^k = 100:

d₁ = ⁶⁰/₁₀₀,      d₂ = ¹²/₁₀₀

For any positive scalar c > 0:

HCF(c · a, c · b) = c · HCF(a, b)

LCM(c · a, c · b) = c · LCM(a, b)

Setting c = 10^–k = ¹/₁₀₀:

HCF(0.60, 0.12) = ¹/_10² × HCF(60, 12) = ¹²/₁₀₀ = 0.12

LCM(0.60, 0.12) = ¹/_10² × LCM(60, 12) = ⁶⁰/₁₀₀ = 0.60 = 0.6

Padding decimals with trailing zeros establishes a common integer scale. Stripping decimal points without uniform padding applies mixed scales (10^-1 vs 10^-2), invalidating the scalar distributive property.

Key Theorems & Properties

• Boundary Theorem: For any set S:

  H_f ≤ min(S) ≤ max(S) ≤ L_f

  Any calculated HCF greater than the minimum element, or LCM smaller than the maximum element, is mathematically impossible.

• Product Invariant Rule: For exactly two numbers, the standard product identity holds:

  H_f × L_f = r₁ × r₂

  Proof:

  H_f × L_f = ^{HCF(p₁, p₂)}/_{LCM(q1, q2)} × ^{LCM(p₁, p₂)}/_{HCF(q1, q2)} = ^p₁p₂/_q1q2 = r₁ × r₂

  For three or more numbers (n ≥ 3), this relationship fails. Never apply H × L = Product when n ≥ 3.

  Counter-example for n = 3: Let r₁ = ¹/₂, r₂ = ¹/₃, r₃ = ¹/₄.

  H_f = ^{HCF(1, 1, 1)}/_{LCM(2, 3, 4)} = ¹/₁₂,      L_f = ^{LCM(1, 1, 1)}/_{HCF(2, 3, 4)} = ¹/₁ = 1

  H_f × L_f = ¹/₁₂ × 1 = ¹/₁₂ ≠ ¹/₂₄ = (¹/₂ × ¹/₃ × ¹/₄)

• Coprimality Preservation: If all denominators q_i are pairwise coprime, LCM(q_i) = ∏ q_i. Consequently, H_f becomes significantly small—a useful order-of-magnitude sanity check.

2. Comparative Matrix & Conceptual Distinctions

3. High-Yield Data Anchors & Memorization Benchmarks

A. The Reduction Fingerprint

B. Decimal Scale Anchors

• k = 1 (tenths): Scale by 10¹ = 10
• k = 2 (hundredths): Scale by 10² = 100
• k = 3 (thousandths): Scale by 10³ = 1000
• Uniform Scale Rule: k = max(decimal places in the set). For {0.6, 9.6, 0.12}, k = 2 applies to all three numbers (0.60, 9.60, 0.12).

C. Magnitude Check (Rapid Option Elimination)

To evaluate HCF(0.6, 0.12):

1. Boundary check: H_f ≤ min(0.6, 0.12) = 0.12. Any option > 0.12 is eliminated immediately.
2. Equalize: k = 2 ⇒ 60, 12 ⇒ HCF(60, 12) = 12.
3. Descale: ¹²/₁₀₀ = 0.12.
4. For LCM: L_f ≥ max(0.6, 0.12) = 0.6. Any option < 0.6 is eliminated immediately.

4. Standard Algorithmic Protocols

Protocol A: Computing HCF and LCM of Fractions

1. Input: A set of rational numbers ^p₁/_q1, ^p₂/_q2, …, ^p_n/_qn.
2. Canonical Reduction: If gcd(p_i, q_i) ≠ 1, reduce each fraction to its lowest terms.
3. Array Extraction: Separate terms into two sets:
   • Numerators: N = {p₁, p₂, …, p_n}
   • Denominators: D = {q₁, q₂, …, q_n}
4. Formula Execution:
   • For HCF:

     H_f = ^HCF(N)/_LCM(D)

   • For LCM:

     L_f = ^LCM(N)/_HCF(D)

5. Boundary Verification: Confirm that H_f ≤ min(S) and L_f ≥ max(S).
6. Result: Express as a simplified proper or improper fraction.

Protocol B: Computing HCF and LCM of Decimals (Equalization Method)

1. Count Decimal Digits: Determine the number of decimal digits k_i for each term d_i.
2. Find Global Scale: Determine k = max(k₁, k₂, …, k_n).
3. Pad Trailing Zeros: Append zeros to equalize all terms to k decimal places.
   Example: For 0.6 and 0.12 with k = 2, write 0.60 and 0.12.
4. Transform to Integers: Multiply by 10^k (remove decimal point) to obtain integers N_i.
   Example: 0.60 &to; 60, 0.12 &to; 12.
5. Compute Integer Metric: Calculate HCF(N_i) or LCM(N_i) directly.
6. Descale: Shift the decimal point k places to the left (divide by 10^k).
   Example: HCF(60, 12) = 12 ⇒ ¹²/₁₀₀ = 0.12.
7. Boundary Verification: Confirm H ≤ min(d_i) and L ≥ max(d_i).

Operational Warning: Avoid converting decimals into mixed fractions such as ¹²/₁₀ and ⁴⁵/₁₀₀ before applying Protocol A without thorough cross-reduction. The differing powers of 10 require normalization; Protocol B eliminates this redundancy.

5. Standard Question Typologies & Analytical Solutions

Type A: Parity & Hidden Factor Constraint (Fractional HCF)

Question:
Find the HCF of the set of fractions ¹⁴/₂₁, ²⁸/₃₅, and ³⁶/₄₈.

(a) ¹/₁₄₀
(b) ¹/₁₀₅
(c) ²/₁₀₅
(d) ¹/₆₀

Analytical Solution:

Step 1 — Pre-condition Audit:
Check whether gcd(p_i, q_i) = 1 for all terms. All three fractions share common factors and must be reduced.

Step 2 — Reduction to Canonical Form:

¹⁴/₂₁ = ²/₃,      ²⁸/₃₅ = ⁴/₅,      ³⁶/₄₈ = ³/₄

Extract the integer sets:

N = {2, 4, 3} ⇒ HCF(N) = 1

D = {3, 5, 4} ⇒ LCM(D) = 3 × 5 × 4 = 60

Step 3 — Compute HCF:

H_f = ^HCF(N)/_LCM(D) = ¹/₆₀

Step 4 — Boundary Check:
min(S) = ²/₃ ≈ 0.667. Since ¹/₆₀ ≈ 0.0167 ≤ ²/₃, the result satisfies the boundary constraint.

Correct Option: (d) ¹/₆₀

Type B: Statement-Based Conceptual Assessment (Algorithm Integrity)

Question:
Consider the following statements:

• Statement I: The HCF of 0.5 and 0.05 is found by computing the HCF of 5 and 5 and placing the decimal point two places to the left.
• Statement II: To find the LCM of fractions, computing ^{LCM of unreduced numerators}/_{HCF of unreduced denominators} produces a valid least common multiple.

Which of the above statements is/are correct?
(a) I only
(b) II only
(c) Both I and II
(d) Neither I nor II

Analytical Solution:

Evaluation of Statement I:
The maximum decimal places is k = max(1, 2) = 2.
Equalizing gives 0.50 and 0.05 ⇒ integers 50 and 5.
HCF(50, 5) = 5 ⇒ ⁵/₁₀₀ = 0.05.
While taking HCF(5, 5) = 5 &to; 0.05 matches by coincidence here, the method fails generally (e.g., for 0.6 and 0.12, unpadded inputs yield HCF(6, 12) = 6 &to; 0.06, whereas the true HCF is 0.12). The algorithmic statement is conceptually false.

Evaluation of Statement II:
As demonstrated in Section 1, unreduced fractions leave uncancelled factors that artificially inflate the resulting value, producing a common multiple that is not the least. Statement II is false.

Correct Option: (d) Neither I nor II

Type C: Existence & Parameter Counting

Question:
Let S be the set of all fractions ^p/_q in lowest terms such that p < q ≤ 5, with p, q ∈ ℤ⁺. How many fractions in S yield an HCF of ¹/₆₀ when grouped with the set {⁴/₅, ³/₄}?

(a) 1
(b) 2
(c) 3
(d) 4

Analytical Solution:

Step 1 — Group Evaluation:
Let r = ^p/_q ∈ S. The HCF of the combined set is:

HCF(⁴/₅, ³/₄, ^p/_q) = ^{HCF(4, 3, p)}/_{LCM(5, 4, q)} = ¹/₆₀

Step 2 — Numerator Analysis:
Since HCF(4, 3) = 1, we have HCF(1, p) = 1 for any positive integer p. The numerator constraint is universally satisfied.

Step 3 — Denominator Analysis:
We require:

LCM(20, q) = 60

Prime factorizations:

20 = 2² × 5,      60 = 2² × 3 × 5

Thus, q must contain 3¹ as a factor and must divide 60. Given q ≤ 5, testing possible integer values:

• If q = 1 ⇒ LCM(20, 1) = 20 ≠ 60
• If q = 2 ⇒ LCM(20, 2) = 20 ≠ 60
• If q = 3 ⇒ LCM(20, 3) = 60 (Valid)
• If q = 4 ⇒ LCM(20, 4) = 20 ≠ 60
• If q = 5 ⇒ LCM(20, 5) = 20 ≠ 60

Hence, q = 3 is the unique solution for the denominator.

Step 4 — Enumerating Valid Numerators:
With q = 3, the condition p < q and gcd(p, 3) = 1 yields:

p ∈ {1, 2}

The valid fractions are ¹/₃ and ²/₃ (Total = 2).

Correct Option: (b) 2

Type D: Algebraic Invariants & Product Identities

Question:
For the decimal numbers a = 0.6 and b = 0.12, evaluate the following statements:

• Statement I: HCF(a, b) × LCM(a, b) = a × b
• Statement II: LCM(a, b) = 0.6 and HCF(a, b) = 0.12

Which of the statements is/are correct?
(a) I only
(b) II only
(c) Both I and II
(d) Neither I nor II

Analytical Solution:

Step 1 — Compute HCF and LCM:
Set k = max(1, 2) = 2.
Scaled integers: N₁ = 60, N₂ = 12.

• HCF(60, 12) = 12 ⇒ HCF(a, b) = 0.12
• LCM(60, 12) = 60 ⇒ LCM(a, b) = 0.60 = 0.6

Statement II is true.

Step 2 — Verify Product Invariant:

a × b = 0.6 × 0.12 = 0.072

HCF(a, b) × LCM(a, b) = 0.12 × 0.6 = 0.072

Because n = 2, the product identity holds rigorously. Statement I is true.

Correct Option: (c) Both I and II

Type E: Joint Multi-Term Fraction Evaluation

Question:
Determine the HCF and LCM of the set {²⁸/₃₅, ⁴²/₅₆, ¹⁴/₂₁}.

(a) HCF = ¹/₆₀, LCM = 12
(b) HCF = ¹/₃₀, LCM = 6
(c) HCF = ⁷/₈₄₀, LCM = 84
(d) HCF = ²/₁₀₅, LCM = 12

Analytical Solution:

Step 1 — Mandatory Reduction:

²⁸/₃₅ = ⁴/₅,      ⁴²/₅₆ = ³/₄,      ¹⁴/₂₁ = ²/₃

Step 2 — Compute HCF:

H_f = ^{HCF(4, 3, 2)}/_{LCM(5, 4, 3)} = ¹/₆₀

Step 3 — Compute LCM:

L_f = ^{LCM(4, 3, 2)}/_{HCF(5, 4, 3)} = ¹²/₁ = 12

Correct Option: (a) HCF = ¹/₆₀, LCM = 12

Type F: Multi-Term Decimal Evaluation

Question:
Find the LCM of 0.6, 9.6, and 0.12.

(a) 9.6
(b) 0.12
(c) 28.8
(d) 0.6

Analytical Solution:

Step 1 — Equalize Decimals:
Number of decimal places: k₁ = 1, k₂ = 1, k₃ = 2 ⇒ k = 2.
Equalized values: 0.60, 9.60, 0.12.

Step 2 — Integer Mapping:

N = {60, 960, 12}

Step 3 — Integer LCM Calculation:
Notice that 12 | 60 and 60 | 960 (960 / 60 = 16).
Since 12 and 60 both divide 960, LCM(60, 960, 12) = 960.

Step 4 — Descale:

L = ⁹⁶⁰/_10² = 9.60 = 9.6

Correct Option: (a) 9.6

6. The Examiner Trap Matrix

7. Golden Rules & Instant Exam Triggers

Key Pedagogical Takeaway: Fraction problems test reduction discipline; decimal problems test scale equalization. Most errors stem from skipping these initial formatting steps rather than the core LCM/HCF calculations. Verifying canonical form at the outset guarantees accuracy.