A certain game pays players in tokens, each of which is worth…

A certain game pays players in tokens, each of which is worth either m points or n points, where m and n are different positive integers whose greatest common factor is 1. In terms of m and n, what is the greatest possible sum, in points, that can be paid out with only one unique combination of these tokens? (For example, if m = 2 and n = 3, then a sum of 5 points can be created using only one combination, m + n, which is a unique combination. By contrast, a sum of 11 points can be created by 4m + n or by m + 3n. This solution does not represent a unique combination; two combinations are possible.)

Its source gives only the correct option, without the working.

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #34273