About fractions whose sum is a natural number
Some days ago I found an old problem of an olympiad that I always found interesting. It asks to replace each with the numbers without repeating any number, such that their sum is an integer number.
I got a solution by trial-and-error and it's:
I was wondering if there is another method different than trial-and-error. Thanks in advance for your answers.