MathDB
A 76

Source:

May 25, 2007
Divisibility Theory

Problem Statement

Find all integers a,b,c\,a,b,c\, with 1<a<b<c\,1<a<b<c\, such that (a1)(b1)(c1)is a divisor ofabc1.(a-1)(b-1)(c-1)\hspace{0.2in}\text{is a divisor of}\hspace{0.2in}abc-1.