Overview
This chapter is about what numbers have in common. It begins with real problems: the largest square tile that fits a room exactly, and the heaviest equal bags that can hold rice from two farms. These lead to the Highest Common Factor (HCF), the greatest number that divides all the given numbers. Listing factors becomes slow for large numbers, so you revisit primes and learn the division method for prime factorisation, and see that every number has only one prime factorisation. From it you build every factor of a number and then find the HCF directly by taking shared primes the fewest number of times. Problems about cloth strips, sweet-shop visits and the idli-vada game lead to the Lowest Common Multiple (LCM), which you find by taking every prime the greatest number of times. You then explore patterns and make general statements, for example that consecutive numbers have HCF 1 and that doubling two numbers doubles their HCF. Finally, a quick ladder procedure gives the HCF and LCM together, and you discover that for two numbers HCF × LCM equals their product. Along the way you meet the ideas of conjecture, counterexample and generalisation.
हिंदी में पढ़ें
साझा आधार की खोज: महत्तम समापवर्तक (म.स.) और लघुत्तम समापवर्त्य (ल.स.), अभाज्य गुणनखंडन से शीघ्रता से ज्ञात करना।
Learning Objectives
- Find common factors and the HCF of numbers and use them in real problems
- Find the prime factorisation of a number using the division method
- List all the factors of a number from its prime factorisation
- Find the HCF using prime factorisation
- Find common multiples and the LCM and recognise LCM situations
- Find the LCM using prime factorisation
- Make and test general statements about HCF and LCM
- Use the ladder procedure and the relation HCF × LCM = product of two numbers
- Use the words conjecture, counterexample and generalisation correctly
Topics in this chapter
8 topics · tap a topic title to jump straight to it.
Common factors and the HCF
1Think first
2The idea, in plain words
Sameeksha wants to tile a room 12 ft wide and 16 ft long with square tiles, all the same size, with sides a whole number of feet. She wants as few tiles as possible. What size should she buy?
For tiles to fit the 12 ft side exactly, the tile side must divide 12. For the 16 ft side, it must divide 16. So the side must be a common factor of 12 and 16.
| Number | Factors |
| 12 | 1, 2, 3, 4, 6, 12 |
| 16 | 1, 2, 4, 8, 16 |
| Common | 1, 2, 4 |
The tile could be 1 ft, 2 ft or 4 ft. The bigger the tile, the fewer tiles are needed, so she picks 4 ft. Along the width there are 12 ÷ 4 = 3 tiles and along the length 16 ÷ 4 = 4 tiles, so 3 × 4 = 12 tiles in all.
The HCF. The Highest Common Factor (HCF) of two or more numbers is the greatest of their common factors. It is also called the Greatest Common Divisor (GCD). Here the HCF of 12 and 16 is 4.
Another example. Lekhana buys 84 kg of rice from one farm and 108 kg from another. She packs it into bags of equal whole-number weight, each bag from one farm only, using as few bags as possible. The bag weight must be a common factor of 84 and 108: 1, 2, 3, 4, 6 or 12 kg. The fewest bags come from the heaviest weight, 12 kg, which is the HCF. She needs 84 ÷ 12 = 7 bags and 108 ÷ 12 = 9 bags, that is 16 bags.
Jumps on a number line. If treasures lie on 14 and 30, the longest jump from 0 that lands on both must divide both numbers, so it is the HCF, 2. For 28 and 42 it is 14, and for 7 and 11 it is only 1.
Why listing is not enough. Listing every factor works for small numbers, but it is slow for numbers such as 840, which has 32 factors, and it is easy to miss one. In the next topics we find a faster and more reliable way using primes.
- HCF = greatest common factor (also called GCD)
- Number of square tiles = (length ÷ HCF) × (breadth ÷ HCF)
3Worked example
- HCF of 12 and 16 is 4: twelve tiles of 4 ft cover a 12 ft × 16 ft room.
- HCF of 84 and 108 is 12: 7 + 9 = 16 bags.
- HCF of 28 and 42 is 14.
4Your turn
What is the HCF of 84 and 108?
5Remember this
Primes and prime factorisation
1Think first
2The idea, in plain words
A prime is a number greater than 1 whose only factors are 1 and itself: 2, 3, 5, 7, 11, 13, and so on. A number greater than 1 that is not prime is composite. The number 1 is neither.
Prime factorisation. Every composite number can be written as a product of primes. Keep breaking any composite factor until only primes are left. For 90: 90 = 9 × 10 = 3 × 3 × 2 × 5. We could also start with 3 × 30 or 2 × 45, but we always end with the same primes, 2, 3, 3 and 5, only in a different order. This is a remarkable fact: every number has exactly one prime factorisation, apart from order.
The division method. Divide by a prime, write the quotient below, and repeat until the quotient is prime.
| Divide by | Number |
| 2 | 1200 |
| 2 | 600 |
| 2 | 300 |
| 2 | 150 |
| 3 | 75 |
| 5 | 25 |
| 5 |
So 1200 = 2 × 2 × 2 × 2 × 3 × 5 × 5. Reading the primes down the left side and the last number at the bottom gives the factorisation. This is quicker and safer than splitting 1200 as 40 × 30 = 5 × 8 × 5 × 6 and then breaking 8 and 6 again.
Tips for the division method. Try the small primes in order: 2 while the number is even, then 3 (digit sum divisible by 3), then 5 (ends in 0 or 5), then 7, 11 and so on. Stop when the last quotient is prime. For 105: 105 ÷ 3 = 35, 35 ÷ 5 = 7, so 105 = 3 × 5 × 7.
Bigger is not always longer. Anshu guessed: ‘the larger a number, the longer its prime factorisation’. But 96 = 2 × 2 × 2 × 2 × 2 × 3 has six primes while the larger number 121 = 11 × 11 has only two. A statement made without proof is called a conjecture. One example that shows it is false is a counterexample, and one counterexample is enough to disprove a conjecture.
The prime factorisation of a prime number is just the number itself, for example 13 = 13.
- Every number greater than 1 has exactly one prime factorisation (apart from order)
3Worked example
- 90 = 2 × 3 × 3 × 5.
- 1200 = 2 × 2 × 2 × 2 × 3 × 5 × 5.
- 96 has six prime factors but 121 has only two.
4Your turn
Which is the prime factorisation of 60?
5Remember this
Finding all factors from the prime factorisation
1Think first
2The idea, in plain words
The prime factorisation of a number is like a box of building blocks: every factor of the number is built from some of those blocks. We call such a selection a subpart of the factorisation.
Example. 840 = 2 × 2 × 2 × 3 × 5 × 7. Is 28 = 2 × 2 × 7 a factor? Regroup the primes: 840 = (2 × 2 × 7) × (2 × 3 × 5) = 28 × 30. So 28 is a factor, and the leftover primes give the partner factor 30.
Is 2 × 2 × 2 = 8 a factor of 840? Yes, there are three 2s available. Is 3 × 3 × 3 = 27 a factor? No: 840 has only one 3, so we cannot pick three of them.
Listing every factor of 225. 225 = 3 × 3 × 5 × 5. Build subparts in order of size:
| Number of primes used | Factors |
| none | 1 |
| one | 3, 5 |
| two | 3 × 3 = 9, 3 × 5 = 15, 5 × 5 = 25 |
| three | 3 × 3 × 5 = 45, 3 × 5 × 5 = 75 |
| four | 3 × 3 × 5 × 5 = 225 |
So the factors of 225 are 1, 3, 5, 9, 15, 25, 45, 75 and 225, nine in all. Because we built them systematically, we cannot miss one.
A neat way to count. From 3 × 3 we may take no 3, one 3 or two 3s: 3 choices. From 5 × 5 we also have 3 choices. Every combination gives a different factor, so 225 has 3 × 3 = 9 factors. In the same way 840 = 2 × 2 × 2 × 3 × 5 × 7 has 4 × 2 × 2 × 2 = 32 factors, and 360 = 2 × 2 × 2 × 3 × 3 × 5 has 4 × 3 × 2 = 24 factors.
Why it matters. If a factor of a number must use only its own primes, then a factor common to two numbers must be built from primes that both numbers share. This is the key idea behind finding the HCF quickly in the next topic.
- A factor of n uses only primes from n's factorisation, each at most as often as it appears
3Worked example
- 840 = 28 × 30, since (2 × 2 × 7) × (2 × 3 × 5).
- 27 is not a factor of 840: 840 has only one 3.
- Factors of 225: 1, 3, 5, 9, 15, 25, 45, 75, 225.
4Your turn
Using 840 = 2 × 2 × 2 × 3 × 5 × 7, which is NOT a factor of 840?
5Remember this
HCF using prime factorisation
1Think first
2The idea, in plain words
A common factor of two numbers must be a subpart of both factorisations. The HCF is the largest such common subpart.
Example 1: 45 and 75. 45 = 3 × 3 × 5 and 75 = 3 × 5 × 5. The common subparts are 3, 5 and 3 × 5. With 1, the common factors are 1, 3, 5 and 15. The HCF is 15.
Example 2: 112 and 84. 112 = 2 × 2 × 2 × 2 × 7 and 84 = 2 × 2 × 3 × 7. The common subparts are 2, 7, 2 × 2, 2 × 7 and 2 × 2 × 7. The HCF is 2 × 2 × 7 = 28.
Example 3: 96 and 275. 96 = 2 × 2 × 2 × 2 × 2 × 3 and 275 = 5 × 5 × 11. They share no prime, so the only common factor is 1. Numbers whose HCF is 1 are called co-prime.
A direct rule. We need not list all the common subparts. Take each prime that appears in both numbers, as many times as it appears in the number that has fewer of it.
| Numbers | Factorisations | Common primes, fewest times | HCF |
| 30, 72 | 2 × 3 × 5; 2 × 2 × 2 × 3 × 3 | one 2, one 3 | 6 |
| 225, 750 | 3 × 3 × 5 × 5; 2 × 3 × 5 × 5 × 5 | one 3, two 5s | 75 |
| 24, 180 | 2 × 2 × 2 × 3; 2 × 2 × 3 × 3 × 5 | two 2s, one 3 | 12 |
Why the fewest? For 30 and 72, the HCF cannot contain two 2s, because 30 has only one 2. So it gets one 2. The same reasoning applies to every prime.
Three or more numbers. Use the same rule across all the numbers. For 42, 75 and 24: 42 = 2 × 3 × 7, 75 = 3 × 5 × 5, 24 = 2 × 2 × 2 × 3. Only 3 is in all three, once, so the HCF is 3.
A trap. 72 = 6 × 12 and 144 = 8 × 18 look as if they share nothing. But 6, 12, 8 and 18 are not primes. Breaking them down shows 72 = 2 × 2 × 2 × 3 × 3 and 144 = 2 × 2 × 2 × 2 × 3 × 3, with HCF 72. Always go all the way to primes.
- HCF = product of common primes, each taken the fewest times it appears
3Worked example
- HCF(45, 75) = 15.
- HCF(112, 84) = 28.
- HCF(96, 275) = 1: they are co-prime.
4Your turn
What is the HCF of 225 and 750?
5Remember this
Common multiples and the LCM
1Think first
2The idea, in plain words
Anshu stitches torans from cloth strips 6 cm long, and Guna from strips 8 cm long. They want to make torans of the same length. What is the shortest such length?
Anshu's torans can be 6, 12, 18, 24, 30, 36, 42, 48 cm, and so on: the multiples of 6. Guna's can be 8, 16, 24, 32, 40, 48 cm, and so on: the multiples of 8. Lengths in both lists are common multiples: 24, 48, 72, and so on. The shortest is 24 cm.
The LCM. The Lowest Common Multiple (LCM) of two or more numbers is the smallest of their common multiples. The LCM of 6 and 8 is 24. Notice that there is no largest common multiple, because the list goes on for ever.
Free gajak. A sweet shop gives free gajak every Monday, that is every 7 days. Kabamai visits every 10 days, and both happened today. Shop days come after 7, 14, 21, … days; her visits after 10, 20, 30, … days. They first coincide after 70 days, the LCM of 7 and 10.
The idli-vada game. Players count 1, 2, 3, … and say ‘idli’ on multiples of one number and ‘vada’ on multiples of the other. The first time they must say ‘idli-vada’ is at the LCM.
| Idli | Vada | First ‘idli-vada’ (LCM) |
| 4 | 6 | 12 |
| 7 | 11 | 77 |
| 14 | 30 | 210 |
HCF or LCM? A useful check is the size of the answer. Cutting or sharing into equal parts gives an answer that is no larger than the numbers: think HCF. Things repeating until they line up again give an answer that is no smaller than the numbers: think LCM.
Listing multiples is fine for small numbers, but for 14 and 30 you must go to 210. Prime factorisation gives the LCM much faster, as the next topic shows.
- LCM = lowest common multiple
- Sharing into equal parts → HCF; repeating events lining up → LCM
3Worked example
- LCM of 6 and 8 is 24: the shortest common toran.
- LCM of 7 and 10 is 70 days.
- LCM of 4 and 6 is 12.
4Your turn
What is the LCM of 7 and 10?
5Remember this
LCM using prime factorisation
1Think first
2The idea, in plain words
A multiple of a number contains all the primes of that number, plus possibly more. For example 36 = 2 × 2 × 3 × 3, and its multiple 648 = 36 × 18 = (2 × 2 × 3 × 3) × (2 × 3 × 3). The factorisation of 36 sits inside the factorisation of 648.
So a common multiple of two numbers must contain the whole factorisation of each. The LCM is the smallest product that does this.
Example: 14 and 35. 14 = 2 × 7 and 35 = 5 × 7. We need 2 × 7 inside, and 5 × 7 inside. The product 2 × 5 × 7 = 70 contains both, sharing the single 7. Removing any prime would lose one of them, so the LCM is 70. Products such as 2 × 7 × 5 × 7 × 3 are also common multiples, but larger.
A direct rule. For each prime that appears in either number, take it as many times as it appears in the number that has more of it.
Example: 96 and 360.
| Prime | In 96 | In 360 | Take |
| 2 | five times | three times | five |
| 3 | once | twice | two |
| 5 | none | once | one |
LCM = 2 × 2 × 2 × 2 × 2 × 3 × 3 × 5 = 1440. Fewer 2s would not contain 96; more would make a larger common multiple.
Compare with the HCF. For 30 = 2 × 3 × 5 and 72 = 2 × 2 × 2 × 3 × 3: the HCF takes the fewest of each shared prime, 2 × 3 = 6. The LCM takes the most of every prime, 2 × 2 × 2 × 3 × 3 × 5 = 360.
Three numbers. The rule works for any number of values. For 105 = 3 × 5 × 7, 195 = 3 × 5 × 13 and 65 = 5 × 13, take 3, 5, 7 and 13 once each: LCM = 1365.
Using answers as primes. It is often fine to leave an LCM in factorised form, such as 2⁵ × 3² × 5, when a question asks for it that way.
- LCM = product of all primes, each taken the most times it appears
- HCF takes the fewest; LCM takes the most
3Worked example
- LCM(14, 35) = 2 × 5 × 7 = 70.
- LCM(96, 360) = 1440.
- LCM(30, 72) = 360.
4Your turn
Which is the LCM of 2 × 2 × 3 and 2 × 3 × 3?
5Remember this
Patterns and general statements about HCF and LCM
1Think first
2The idea, in plain words
Mathematicians look for patterns and then try to explain them. A statement that holds in all cases is a general statement, and finding one is called generalisation.
When one number divides the other. The HCF of 6 and 18 is 6, and the LCM is 18. In general, for a number n and a multiple of it such as 5n, the HCF is n and the LCM is 5n. The HCF is the smaller number and the LCM is the larger.
More patterns to test with examples.
| Pair of numbers | HCF | LCM |
| Two consecutive numbers, e.g. 8 and 9 | 1 | their product, 72 |
| Two consecutive even numbers, e.g. 10 and 12 | 2 | half the product, 60 |
| Two co-prime numbers, e.g. 4 and 9 | 1 | their product, 36 |
| Two consecutive odd numbers, e.g. 15 and 17 | 1 | their product, 255 |
Why is the HCF of two consecutive numbers always 1? Any common factor would also divide their difference, which is 1. The same idea shows that two consecutive odd numbers, which differ by 2 and are both odd, also have HCF 1.
Doubling. If both numbers are doubled, each gets one extra 2 in its factorisation, and that 2 goes into the HCF. So the HCF doubles too. For 270 and 50, the HCF is 10; for 540 and 100, it is 20.
A shared multiplier. 14 × 6 and 14 × 9 clearly have 14 as a common factor. But 6 and 9 still share a 3, so the HCF is 14 × 3 = 42, not 14. The HCF equals the shared multiplier only when the leftover numbers are co-prime, as in 10 × 38 and 10 × 21, where the HCF is 10.
LCM and the product. The product of two numbers is always a common multiple, so the LCM is never larger than the product. It equals the product exactly when the numbers are co-prime.
- If a divides b: HCF = a, LCM = b
- Consecutive numbers: HCF = 1, LCM = product
- Doubling both numbers doubles the HCF
3Worked example
- HCF(n, 5n) = n and LCM(n, 5n) = 5n.
- HCF(270, 50) = 10 and HCF(540, 100) = 20.
- HCF(14 × 6, 14 × 9) = 42.
4Your turn
What is the HCF of two consecutive even numbers such as 14 and 16?
5Remember this
A quick ladder for HCF and LCM, and HCF × LCM
1Think first
2The idea, in plain words
Here is an efficient way to get the HCF and the LCM together. Write the two numbers side by side and keep dividing both by a common factor until the two quotients share no factor.
| Divide by | Numbers |
| 2 | 84, 180 |
| 2 | 42, 90 |
| 3 | 21, 45 |
| 7, 15 |
HCF = the product of the divisors on the left: 2 × 2 × 3 = 12.
LCM = the divisors on the left times the two numbers at the bottom: 2 × 2 × 3 × 7 × 15 = 1260.
Why it works. The left column collects exactly the primes the two numbers share, so it is the HCF. The bottom row holds the primes that belong to only one number. The LCM needs the shared part once plus all the leftover parts, which is exactly the left column times the bottom row.
Bigger steps are allowed. You need not divide by primes only. For 630 and 770, divide both by 10 to get 63 and 77, then by 7 to get 9 and 11, which share nothing. HCF = 10 × 7 = 70 and LCM = 10 × 7 × 9 × 11 = 6930. For 300 and 150, divide by 50 and then by 3 to reach 2 and 1, so HCF = 150 and LCM = 300.
A beautiful relation. For 105 = 3 × 5 × 7 and 95 = 5 × 19, the LCM is 3 × 5 × 7 × 19 = 1995 and the HCF is 5. The product 105 × 95 = 9975 = 1995 × 5. In general:
| For any two numbers a and b |
| HCF × LCM = a × b |
The reason is that, in the product, every shared prime appears twice and every unshared prime once. The HCF takes one copy of the shared primes and the LCM takes the other copy along with all the unshared ones. Check: for 12 and 18, HCF 6 × LCM 36 = 216 = 12 × 18.
Careful. This relation is for two numbers. For three numbers it usually fails.
- HCF = product of the ladder divisors
- LCM = ladder divisors × bottom numbers
- HCF × LCM = a × b (two numbers only)
3Worked example
- Ladder for 84 and 180: HCF 12, LCM 1260.
- 630 and 770: HCF 70, LCM 6930.
- 105 × 95 = 9975 = HCF 5 × LCM 1995.
4Your turn
In a ladder for 18 and 24, the divisors are 2 and 3 and the bottom pair is 3, 4. What is the LCM?
5Remember this
Key Concepts
- Factor
- A number that divides another number exactly.
- Common factor
- A number that is a factor of each of the given numbers.
- HCF (GCD)
- The highest common factor of two or more numbers.
- Prime number
- A number greater than 1 whose only factors are 1 and itself.
- Composite number
- A number greater than 1 that has more than two factors.
- Prime factorisation
- Writing a number as a product of primes; it is unique apart from order.
- Division method
- Repeatedly dividing by primes to find the prime factorisation.
- Subpart
- A selection of primes from a prime factorisation; its product is a factor.
- Co-prime numbers
- Numbers whose HCF is 1.
- Multiple
- A number obtained by multiplying a given number by a counting number.
- Common multiple
- A number that is a multiple of each of the given numbers.
- LCM
- The lowest common multiple of two or more numbers.
- Conjecture
- A statement believed to be true but not yet proved.
- Counterexample
- An example that shows a statement is false.
- Generalisation
- Finding a statement that holds in all cases of a pattern.
- HCF × LCM rule
- For two numbers, HCF × LCM equals the product of the numbers.
End-of-Chapter Trial Paper & Test Questions
Topic-wise questions to test your understanding of every concept in this chapter.
-
Find the largest square tile that exactly covers a 12 ft by 16 ft floor, and the number of tiles. / 12 ft × 16 ft के फ़र्श को पूरा ढकने वाली सबसे बड़ी वर्गाकार टाइल और टाइलों की संख्या ज्ञात कीजिए।
Show answer
The tile side is the HCF of 12 and 16, which is 4 ft, and the number of tiles is 3 × 4 = 12. / टाइल की भुजा 12 और 16 का म.स. (HCF) है, जो 4 ft है, और टाइलों की संख्या 3 × 4 = 12 है।
-
Write the prime factorisation of 1200 by the division method. / भाग विधि से 1200 का अभाज्य गुणनखंडन लिखिए।
Show answer
Dividing by 2 four times, then by 3 and 5, gives 1200 = 2 × 2 × 2 × 2 × 3 × 5 × 5. / 2 से चार बार, फिर 3 और 5 से भाग देने पर 1200 = 2 × 2 × 2 × 2 × 3 × 5 × 5 मिलता है।
-
List all the factors of 225 using its prime factorisation. / अभाज्य गुणनखंडन से 225 के सभी गुणनखंड लिखिए।
Show answer
Since 225 = 3 × 3 × 5 × 5, its factors are 1, 3, 5, 9, 15, 25, 45, 75 and 225. / क्योंकि 225 = 3 × 3 × 5 × 5, इसके गुणनखंड 1, 3, 5, 9, 15, 25, 45, 75 और 225 हैं।
-
Show that Anshu's claim ‘a larger number has a longer prime factorisation’ is false. / दर्शाइए कि अंशु का दावा ‘बड़ी संख्या का अभाज्य गुणनखंडन लंबा होता है’ गलत है।
Show answer
96 = 2 × 2 × 2 × 2 × 2 × 3 has six primes, while the larger 121 = 11 × 11 has only two, so this counterexample disproves the claim. / 96 = 2 × 2 × 2 × 2 × 2 × 3 में छह अभाज्य हैं, जबकि बड़ी संख्या 121 = 11 × 11 में केवल दो हैं, अतः यह प्रति-उदाहरण दावे को गलत सिद्ध करता है।
-
Find the HCF of 30 and 72 using prime factorisation. / अभाज्य गुणनखंडन से 30 और 72 का म.स. ज्ञात कीजिए।
Show answer
30 = 2 × 3 × 5 and 72 = 2 × 2 × 2 × 3 × 3; the shared primes taken the fewest times are one 2 and one 3, so the HCF is 6. / 30 = 2 × 3 × 5 और 72 = 2 × 2 × 2 × 3 × 3; साझा अभाज्यों को न्यूनतम बार लेने पर एक 2 और एक 3 मिलते हैं, अतः म.स. 6 है।
-
Find the LCM of 96 and 360. / 96 और 360 का ल.स. (LCM) ज्ञात कीजिए।
Show answer
96 = 2⁵ × 3 and 360 = 2³ × 3² × 5, so taking each prime the most times gives LCM = 2⁵ × 3² × 5 = 1440. / 96 = 2⁵ × 3 और 360 = 2³ × 3² × 5, अतः प्रत्येक अभाज्य को अधिकतम बार लेने पर ल.स. = 2⁵ × 3² × 5 = 1440।
-
Kabamai visits a shop every 10 days and free sweets are given every 7 days. After how many days will both happen together again? / कबामाई हर 10 दिन में दुकान जाती है और मुफ़्त मिठाई हर 7 दिन में मिलती है। कितने दिन बाद दोनों फिर एक साथ होंगे?
Show answer
They coincide after the LCM of 7 and 10, which is 70 days, because 7 and 10 have no common factor. / वे 7 और 10 के ल.स. अर्थात् 70 दिन बाद एक साथ होंगे, क्योंकि 7 और 10 का कोई उभयनिष्ठ गुणनखंड नहीं है।
-
Why is the HCF of two consecutive numbers always 1? / दो क्रमागत संख्याओं का म.स. सदा 1 क्यों होता है?
Show answer
Any common factor of two numbers also divides their difference, and the difference of consecutive numbers is 1, so the only common factor is 1. / दो संख्याओं का कोई भी उभयनिष्ठ गुणनखंड उनके अंतर को भी विभाजित करता है, और क्रमागत संख्याओं का अंतर 1 है, अतः एकमात्र उभयनिष्ठ गुणनखंड 1 है।
-
Use the ladder method to find the HCF and LCM of 630 and 770. / सीढ़ी विधि से 630 और 770 का म.स. और ल.स. ज्ञात कीजिए।
Show answer
Dividing by 10 and then 7 leaves 9 and 11, so the HCF is 10 × 7 = 70 and the LCM is 70 × 9 × 11 = 6930. / 10 और फिर 7 से भाग देने पर 9 और 11 बचते हैं, अतः म.स. 10 × 7 = 70 और ल.स. 70 × 9 × 11 = 6930 है।
-
A cowherd has fewer than 200 cows that split equally through 3, 5 and 7 gates. How many cows are there? / एक ग्वाले के पास 200 से कम गायें हैं जो 3, 5 और 7 द्वारों से बराबर बँटकर निकलती हैं। गायें कितनी हैं?
Show answer
The number must be a common multiple of 3, 5 and 7; their LCM is 105 and the next is 210, so there are 105 cows. / संख्या 3, 5 और 7 का सार्व गुणज होनी चाहिए; इनका ल.स. 105 है और अगला 210 है, अतः गायें 105 हैं।
Related Laws & Principles
Explore allFoundational laws & principles behind this chapter. Each one opens a full page — what it says, why it matters, five practice questions and the mistakes to avoid.