Category 2 · Quantitative Aptitude
HCF, LCM and Divisibility Rules
9 micro topics in Quantitative Aptitude for Quantitative Aptitude, in book order: Highest Common Factor (HCF) by Division and Prime Factorization Method; Lowest Common Multiple (LCM) by Division and Prime Factorization Method; and 7 more.
-
2.1
Highest Common Factor (HCF) by Division and Prime Factorization Method
The Highest Common Factor (HCF), also called the Greatest Common Divisor (GCD), of two or more numbers is the largest number that divides each of them exactly. It is found either by prime factorization, taking the…
-
2.2
Lowest Common Multiple (LCM) by Division and Prime Factorization Method
The Lowest Common Multiple (LCM) of two or more numbers is the smallest number that each of them divides exactly. It is found by prime factorization, taking every prime that appears with its highest power, or…
-
2.3
Relationship Between HCF, LCM and the Product of Two Numbers
For any two positive numbers, the product of the numbers equals the product of their HCF and LCM. This rule lets one unknown be found from the other three quantities, and it is used to find…
-
2.4
HCF and LCM of Fractions and Decimal Numbers
The HCF of fractions is the HCF of the numerators divided by the LCM of the denominators, and the LCM of fractions is the LCM of the numerators divided by the HCF of the denominators, with…
-
2.5
Applications of HCF and LCM in Word Problems (Bells Ringing Together, Tank Filling, Traffic Lights)
HCF and LCM word problems use the HCF when the question asks for the largest equal piece, greatest measure or biggest groups that fit exactly, and the LCM when events repeat and the question asks when…
-
2.6
Verification Using the Rule: Product of Two Numbers = HCF × LCM
The rule that the product of two numbers equals their HCF multiplied by their LCM is used to check answers. A pair of given HCF and LCM values is valid only if the LCM is a…
-
2.7
Least Number Divisible by Given Numbers Leaving a Specified Common Remainder
The least number that leaves the same remainder r when divided by several numbers is LCM of the numbers plus r. If the remainders differ but the gap between each divisor and its remainder is constant,…
-
2.8
Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case
The greatest number that divides given numbers and leaves the same remainder in each case is the HCF of the differences between the numbers. The remainder itself is then found by dividing any one of the…
-
2.9
Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders
The greatest number that divides given numbers leaving specified remainders is the HCF of the numbers after each remainder is subtracted. Every divisor found this way must be larger than the largest remainder, since a remainder…
← All Quantitative Aptitude categories
Frequently asked questions
Which topics are in HCF, LCM and Divisibility Rules?
HCF, LCM and Divisibility Rules has 9 micro topics in Quantitative Aptitude: Highest Common Factor (HCF) by Division and Prime Factorization Method; Lowest Common Multiple (LCM) by Division and Prime Factorization Method; Relationship Between HCF, LCM and the Product of Two Numbers; HCF and LCM of Fractions and Decimal Numbers; Applications of HCF and LCM in Word Problems (Bells Ringing Together, Tank Filling, Traffic Lights); Verification Using the Rule: Product of Two Numbers = HCF × LCM; Least Number Divisible by Given Numbers Leaving a Specified Common Remainder; Greatest Number That Divides Given Numbers Leaving the Same Remainder in Each Case; Greatest Number That Exactly Divides Given Numbers After Subtracting Specified Remainders.
Is HCF, LCM and Divisibility Rules important for Quantitative Aptitude?
HCF, LCM and Divisibility Rules is a part of the Quantitative Aptitude Quantitative Aptitude syllabus map on MaargX UPSC. Each of its 9 published topics has key terms, a Mains angle and practice questions.