Monkey Banana Problem

On a remote island, a group of robbers and monkeys are stranded together. The robbers have gathered a heap of bananas and choose to share them equally amongst themselves. However, since these robbers don't trust each other, every night one robber awakens to divide the pile into n equal parts, with m bananas left over that they give to the m monkeys present, before hiding their own share. This process is then repeated by each robber until the next morning when the remaining bananas are split into equal parts again and m is leftover for the monkeys. Your ultimate objective is to determine the minimum number of bananas essential for this task based on the set n and m values. For reference, n ranges from 2 to 8 while m ranges from 1 to 5 and each monkey is provided with a single banana. This app is free, ad-free, and involves no in-app purchases. Test your mathematical and problem-solving skills by solving this brain teaser and compare your answer with the app's output. Voice commands are available; however, some devices may require an English-speaking female voice text-to-speech component to be downloaded and installed. If you identify any problems in the solution, please inform the developers via email.