This triplet of positive integers has this peculiarity:
A product of any its two numbers divided by the 3rd number
has 1 as a remainder.

Find it.
Show that no other exist.

(In reply to re: The triple without complete proof by Charlie)

My program didn't allow for duplicates. Rerunning while allowing duplicates still does not generate another solution with total under 1000.

Posted by Charlie on 2016-11-01 13:42:44