Ramesh has 420 oranges and 130 apples. He wants to pack them into boxes so that every box has the same number of fruits and each box holds only one kind of fruit, using the largest box size possible. Using Euclid's algorithm, how many fruits should each box hold?

Question

Accepted Answer

10. Largest box size = HCF(420,130). 420 = 130 x 3 + 30; 130 = 30 x 4 + 10; 30 = 10 x 3 + 0. HCF = 10.

Ramesh has 420 oranges and 130 apples. He wants to pack them into boxes so that every box has the same number of fruits and each box holds only one kind of fruit, using the largest box size possible.
Using Euclid's algorithm, how many fruits should each box hold?

Step-by-Step Solution

Master this chapter in 30 minutes a day.

More Class 10 Euclid's Division Lemma practice

Ramesh has 420 oranges and 130 apples. He wants to pack them into boxes so that every box has the same number of fruits and each box holds only one kind of fruit, using the largest box size possible.Using Euclid's algorithm, how many fruits should each box hold?

Step-by-Step Solution

Master this chapter in 30 minutes a day.

More Class 10 Euclid's Division Lemma practice

Ramesh has 420 oranges and 130 apples. He wants to pack them into boxes so that every box has the same number of fruits and each box holds only one kind of fruit, using the largest box size possible.
Using Euclid's algorithm, how many fruits should each box hold?