A band of 11 pirates once stole a number of gold coins.
When the pirates tried to divide the coins equally among themselves, 1 coin was left over. The greedy
pirates fought over the remaining coin and one pirate was thrown overboard.
The remaining pirates again tried to share the coins equally, but again 1 coin was left over. They fought again and another pirate was thrown overboard.
When they again tried to divide the coins, all of the pirates got an equal share. What is the smallest number of coins the pirates could have stolen?

Question

A band of 11 pirates once stole a number of gold coins.
When the pirates tried to divide the coins equally among themselves, 1 coin was left over. The greedy
pirates fought over the remaining coin and one pirate was thrown overboard.
The remaining pirates again tried to share the coins equally, but again 1 coin was left over. They fought again and another pirate was thrown overboard.
When they again tried to divide the coins, all of the pirates got an equal share. What is the smallest number of coins the pirates could have stolen?

anonymous · Answer

is it 9 coins? because first there are 11 pirates, 2 are thrown overboard and the smallest number of coins would be 9 since each of the 9 pirates would get 1 coin?

anonymous · Answer

@ganeshie8

bibby · Answer

Arr! I can't read

anonymous · Answer

haha xD

anonymous · Answer

ok what is got is the minimum no. of coins should be 441.

anonymous · Answer

yeaaa it must be 441. you should check for the value of number which is divisible by 11, 10 and 9

anonymous · Answer

|dw:1430411565149:dw|

@ali1029