BPSC Stenographer in BPSC course‹› 0:00 studied

BPSC Stenographer in BPSC · Module 60 · basic depth · 12 min

Divisibility, factors, HCF and LCM

What BPSC Stenographer in BPSC asks from this chapter

Syllabus lines this chapter covers:

  • Written: GS 50, General Science and Mathematics 50, Mental Ability 50 · Mathematics: number system, whole numbers, decimals and fractions, relationships between numbers, basic arithmetic, percentage, ratio and proportion, average, interest, profit and loss
  • Written: GS 50, General Science and Mathematics 50, Mental Ability 50 · Mental ability: analogies, similarities and differences, spatial visualisation and configuration, problem solving, analysis, visual memory, odd one out, observation, relationship concepts, arithmetic reasoning, verbal and non-verbal classification, number and non-verbal series, coding and decoding

BPSC Stenographer in BPSC questions from this module are being sorted into our bank.

Cut to basic depth for BPSC Stenographer in BPSC. 42 deeper paragraphs are in the full chapter.

Start from zero: sharing sweets and waiting for buses

Your mother has made 12 laddoos and wants to share them equally, with none left over. She can give them to 1, 2, 3, 4, 6 or 12 children, but not to 5 or 7. The numbers that share 12 exactly are its factors.

Twelve laddoos, shared fairly

Now think of the bus stand. One bus leaves every 12 minutes and another every 18 minutes, and both left together at 9:00. They will leave together again only at a time that is a multiple of both 12 and 18, and the first such time is 36 minutes later, at 9:36.

These two everyday questions carry the whole chapter. "What divides evenly?" leads to factors and the HCF, the highest common factor. "When do two cycles meet again?" leads to multiples and the LCM, the least common multiple.

The papers ask these ideas in many disguises, such as tiles, bells, packets and remainders. If you learn why each rule works, the disguise stops mattering. So we build the tools first and then learn to spot which one a question needs.

Factors, multiples and prime factorisation

Factors and multiples. A factor of a number divides it with no remainder, so the factors of 18 are 1, 2, 3, 6, 9 and 18. A multiple of a number is that number times 1, 2, 3 and so on, so the multiples of 18 are 18, 36, 54 and so on. A number has only a few factors but endlessly many multiples.

A factor tree for 360

Breaking a number into primes. Keep splitting a number until only primes are left, as in a factor tree. For 360, we get 360 = 2 × 180 = 2 × 2 × 90, and going on, 360 = 2³ × 3² × 5. Whichever way you split, you always reach the same primes with the same powers, and this is why prime factorisation is so reliable.

Counting factors without listing them. Every factor of 360 is made by choosing a power of 2 from 2⁰ to 2³, a power of 3 from 3⁰ to 3², and a power of 5 from 5⁰ to 5¹. That gives 4 choices, 3 choices and 2 choices, so 360 has 4 × 3 × 2 = 24 factors. In general, if N = pᵃ × qᵇ × rᶜ, the number of factors is (a + 1)(b + 1)(c + 1).

Why the "+1" is there. The "+1" counts the choice of not using that prime at all, which is the power 0. Leaving it out is the most common slip in this question type. Check with a small number: 12 = 2² × 3 has (2 + 1)(1 + 1) = 6 factors, and indeed they are 1, 2, 3, 4, 6 and 12.

Why it matters: prime factorisation is the master key of this chapter. Once a number is written as primes, its factors, its HCF and LCM with other numbers, and even whether it is a perfect square, can all be read off directly.

Divisibility tests, and why they work

Tests from the last digits. A number is divisible by 2 if its last digit is even, by 5 if it ends in 0 or 5, and by 10 if it ends in 0. It is divisible by 4 if its last two digits form a multiple of 4, and by 8 if its last three digits form a multiple of 8. These work because 100 is a multiple of 4 and 1,000 is a multiple of 8, so the earlier digits never change the answer.

Why the digit-sum test works for 9

Tests from the digit sum. A number is divisible by 3 if the sum of its digits is divisible by 3, and by 9 if the digit sum is divisible by 9. The reason is that 10, 100 and 1,000 are each one more than a multiple of 9 (9, 99, 999). So 4,356 = 4 × 999 + 3 × 99 + 5 × 9 + (4 + 3 + 5 + 6), and only the bracket decides the remainder.

The test for 11. Add the digits in the odd places from the right, add the digits in the even places, and subtract. If the difference is 0 or a multiple of 11, the number is divisible by 11. For 95,876, the sums are 6 + 8 + 9 = 23 and 7 + 5 = 12, and 23 − 12 = 11, so it passes, and indeed 95,876 = 11 × 8,716.

Composite divisors. To test for 6, test for 2 and 3, because 2 and 3 share no factor. To test for 12, test for 3 and 4, not for 2 and 6, because 2 and 6 overlap. For example, 18 passes the tests for 2 and 6, yet 18 is not divisible by 12.

Why it matters: these tests let you decide in seconds whether a number divides another, which is the first step in simplifying fractions, finding a missing digit, or checking an answer option.

The HCF: the biggest number that divides them all

Meaning. The HCF (highest common factor), also called the GCD, is the largest number that divides each of the given numbers exactly. The HCF of 144 and 180 is the largest number that divides both, and it turns out to be 36.

Euclid's method as cutting squares from a rectangle

Method 1: prime factors. Write 144 = 2⁴ × 3² and 180 = 2² × 3² × 5. Take only the primes common to both, each with its lowest power, so the HCF is 2² × 3² = 36. The lowest power is used because any higher power would fail to divide the number that has fewer of that prime.

Method 2: Euclid's division. Divide the larger number by the smaller and keep the remainder: 180 = 1 × 144 + 36. Now divide 144 by 36: 144 = 4 × 36 + 0. When the remainder becomes 0, the last divisor, 36, is the HCF.

Why Euclid's method works. Any number that divides both 180 and 144 also divides their difference, 36, and any number that divides 144 and 36 also divides 180. So the pair (180, 144) and the pair (144, 36) have exactly the same common factors, and therefore the same HCF. Each step makes the numbers smaller without changing the answer, which is why the method is so fast for big numbers.

Why it matters: the HCF answers every "largest possible equal size" question, such as the biggest tile, the longest measuring rod or the largest equal group.

The LCM: the smallest number they all divide

Meaning. The LCM (least common multiple) is the smallest number that is a multiple of each given number. For 144 and 180 it is 720, because 720 = 5 × 144 = 4 × 180, and no smaller number is a multiple of both.

Lowest powers make the HCF, highest powers make the LCM

Method: highest powers. Take every prime that appears in any of the numbers, each with its highest power. From 144 = 2⁴ × 3² and 180 = 2² × 3² × 5, the LCM is 2⁴ × 3² × 5 = 720. The highest power is needed because the LCM must contain each number completely.

The product rule for two numbers. For any two numbers, HCF × LCM = the product of the numbers. Here 36 × 720 = 25,920 and 144 × 180 = 25,920. The reason is that for each prime, the HCF takes the smaller power and the LCM takes the larger, so together they use exactly the powers of both numbers.

HCF and LCM of fractions. First write each fraction in its lowest terms. Then HCF = HCF of the numerators ÷ LCM of the denominators, and LCM = LCM of the numerators ÷ HCF of the denominators. For ²⁄₃ and ⁴⁄₉, the HCF is ²⁄₉ and the LCM is ⁴⁄₃, and you can check that ⁴⁄₃ is exactly 2 times ²⁄₃ and 3 times ⁴⁄₉.

Why it matters: the LCM answers every "when do they meet again" question, such as buses, bells, traffic lights, duty rosters and machines on different cycles.

Quick revision

One-page summary box
  • A factor divides a number exactly, and every whole number above 1 breaks into primes in only one way.
  • If N = pᵃ × qᵇ × rᶜ, then N has (a + 1)(b + 1)(c + 1) factors.
  • The tests for 4 and 8 use the last two and last three digits, the tests for 3 and 9 use the digit sum, and the test for 11 uses the alternate-digit difference.
  • For a composite divisor such as 12, test its co-prime parts, 3 and 4.
  • The HCF uses the common primes with their lowest powers, and Euclid's division reaches it quickly.
  • The LCM uses all primes with their highest powers, and for two numbers HCF × LCM equals their product.
  • For fractions, HCF = HCF of numerators ÷ LCM of denominators, and LCM = LCM of numerators ÷ HCF of denominators.
  • For the same remainder, take the HCF of the differences; for a given remainder r, take LCM + r; and when each remainder is k short, take LCM − k.

Check yourself

Exam-style questions on this chapter. Pick an answer to see the explanation. 0 of 28 answered

  1. How many factors does 480 have?

  2. How many factors does 72 have?

  3. How many factors does 900 have?

  4. The number 104□ is divisible by 9. What is the smallest possible value of the missing digit?

  5. The number 99□1 is divisible by 3. What is the smallest possible value of the missing digit?

  6. The number 459□ is divisible by 3. What is the smallest possible value of the missing digit?

  7. The number 17□7 is divisible by 3. What is the smallest possible value of the missing digit?

  8. Find the HCF of 99 and 63.

  9. Find the HCF of 792 and 108.

  10. Find the HCF of 99 and 45.

  11. Find the HCF of 264 and 168.

  12. Find the LCM of 4, 6 and 10.

  13. Find the LCM of 4, 15 and 24.

  14. Find the LCM of 9, 12 and 14.

  15. Find the LCM of 9, 10 and 14.

  16. The HCF of two numbers is 4 and their LCM is 40. If one number is 8, what is the other?

  17. The HCF of two numbers is 12 and their LCM is 264. If one number is 24, what is the other?

  18. Find the largest number that divides 118, 352 and 451 leaving the same remainder in each case.

  19. Find the largest number that divides 97, 149 and 197 leaving the same remainder in each case.

  20. Find the largest number that divides 100, 208 and 379 leaving the same remainder in each case.

  21. Find the smallest number that leaves remainders 8, 9 and 11 when divided by 15, 16 and 18.

  22. Find the smallest number that leaves remainder 6 when divided by 10, 15 and 16.

  23. Find the smallest number that leaves remainder 3 when divided by 10, 15 and 16.

  24. A floor measures 3 m 60 cm by 4 m 40 cm. What is the least number of equal square tiles that will cover it exactly?

  25. A floor measures 1 m 80 cm by 2 m 52 cm. What is the least number of equal square tiles that will cover it exactly?

  26. A floor measures 2 m 70 cm by 3 m 30 cm. What is the least number of equal square tiles that will cover it exactly?

  27. Three bells ring every 6, 8 and 15 minutes. They ring together at 9:00. When will they next ring together?

  28. Three bells ring every 6, 15 and 18 minutes. They ring together at 9:00. When will they next ring together?

Previous year questions

Previous year questions for UPSC CSE will appear here once each one is checked word for word against the official question paper.

Frequently asked questions

What is the divisibility rule for 11?

The difference between the sums of digits in odd and even places must be 0 or a multiple of 11.

How do you count the factors of a number?

Write N = pᵃ × qᵇ × rᶜ; the number of factors is (a + 1)(b + 1)(c + 1).

What is the relation between HCF and LCM?

For two numbers a and b, HCF × LCM = a × b.

How do you find the HCF of fractions?

HCF of numerators divided by LCM of denominators; the LCM of fractions is LCM of numerators divided by HCF of denominators.