Audio disabled.
n robbers and m monkeys are stuck on an island. The robbers have collected a pile of bananas. They decided to divide the bananas equally among themselves.
They don't trust each other. One robber wakes up in the night and divides the bananas into n equal parts with m leftovers which he gives to m monkeys. Then he hides his own share.
One by one remaining robbers does the same.
In the morning the robbers gather and split the remaining bananas into n equal parts and again m is leftover for the m monkeys.
Your task is to find the smallest number of bananas required for the above task for a particular set of n and m values.
Each monkey is given one banana.
Here m can vary from 1 to 5 and n varies from 2 to 8.
This app is ABSOLUTELY FREE, NO IN-APP PURCHASES and NO ADS.
You can test your mathematical logic by solving this puzzle by your own and check your answer with this app.
*** note : If there is any error in the answer please let me know through email.
*** All of my apps / games are voice enabled. Proper text to speech (English speaking female voice) component may be downloaded and installed in some phones / devices if it is not already installed or compatible.
