Edit: I finally figured this problem out, although I didn't use residue systems, so a solution is no longer necessary.(adsbygoogle = window.adsbygoogle || []).push({});

1. The problem statement, all variables and given/known data

For this problem, I need to find a fomula for the largest unattainable score in a game where you can either score m or n points at a time (m and n are relatively prime) and prove that this formula will always work. Complete residue systems are suggested to be used in the proof.

2. Relevant equations

{0, n, 2n, 3n, ... , (m-1)n} is a complete residue system mod m when m and n are relatively prime.

3. The attempt at a solution

Through trial and error, I have found that the largest impossible score is mn - (m+n). I'm stuck, however, on proving this. I don't even know how to start, so any help would be greatly appreciated.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Number Theory - Largest Impossible Score

Can you offer guidance or do you also need help?

**Physics Forums | Science Articles, Homework Help, Discussion**