If it were possible to find solutions such as the ones above for enough different moduli, forming a complete covering system of congruences, the problem would be solved.
Požrešni algoritem da za rešitev tri ali manj členov, kadar "n" ni 1 ali 17 (mod 24), primer za "n" ≡ 17 (mod 24) pa pokriva zveza za 2 (mod 3), tako da so edine vrednosti "n", za katere ti dve metodi ne dasta razvoja v treh ali manj členih, tiste, ki so kongruentne 1 (mod 24).