Suppose you have a game in which there are two kinds of scoring events. One event gives a score of m points, and the other gives a score of n points. Assume gcd(m,n)=1. Derive a formula for the largest unattainable score. Prove your answer is correct.(adsbygoogle = window.adsbygoogle || []).push({});

Well, I only can figure of these:

since (m, n)= 1, then we have

{0, m, 2m,...., (n-1)m} as a complete residue system mod n

and

{0, n, 2n,...., (m-1)n} as a complete residue system mod m.

What should I do then?

**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!

# Homework Help: Unattainable scores

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