Answer:
the largest possible amount of each cheque will be 1215.
Step-by-step explanation:
Largest possible amount of cheque will be the HCF(6075,8505).
Applying Euclid's division lemma to 8505 and 6075, we have 8505=6075×1+2430
Since, remainder 2430
=0 again applying division lemma to 6075 and 2430
6075=2430×2+1215
Again remainder 1215
=0
So, again applying the division lemma to 2430 and 1215
2430=1215×2+0
Here the remainder is zero
So, HCF=1215
Therefore, the largest possible amount of each cheque will be 1215.
The largest cheques of same amount will be 2430
Copyright © 2024 EHUB.TIPS team's - All rights reserved.
Answers & Comments
Answer:
the largest possible amount of each cheque will be 1215.
Step-by-step explanation:
Largest possible amount of cheque will be the HCF(6075,8505).
Applying Euclid's division lemma to 8505 and 6075, we have 8505=6075×1+2430
Since, remainder 2430
=0 again applying division lemma to 6075 and 2430
6075=2430×2+1215
Again remainder 1215
=0
So, again applying the division lemma to 2430 and 1215
2430=1215×2+0
Here the remainder is zero
So, HCF=1215
Therefore, the largest possible amount of each cheque will be 1215.
Answer:
The largest cheques of same amount will be 2430