Seven thieves try to share a hoard of gold bars equally between themselves. Unfortunately, six bars...

50.1K

Verified Solution

Question

Advance Math

  1. Seven thieves try to share a hoard of gold bars equally betweenthemselves. Unfortunately, six bars are left over, and in the fightover them, one thief is killed. The remaining six thieves, stillunable to share (all) the bars equally since two are left over,again fight, and another is killed. When the remaining five share(all) the bars, one bar is left over, and it is only after yetanother thief is killed that an equal sharing is possible. What isthe minimum number of bars which allows this to happen? [Hint: Becarefully to check that the conditions for the Chinese RemainderTheorem apply before using it.]

Answer & Explanation Solved by verified expert
3.6 Ratings (309 Votes)
    See Answer
Get Answers to Unlimited Questions

Join us to gain access to millions of questions and expert answers. Enjoy exclusive benefits tailored just for you!

Membership Benefits:
  • Unlimited Question Access with detailed Answers
  • Zin AI - 3 Million Words
  • 10 Dall-E 3 Images
  • 20 Plot Generations
  • Conversation with Dialogue Memory
  • No Ads, Ever!
  • Access to Our Best AI Platform: Flex AI - Your personal assistant for all your inquiries!
Become a Member

Other questions asked by students