The smallest integer that satisfies all of the criteria is 308,051,071,072,-
000,000,000,000,000, or (more concisely)
To prove that this answer is correct, we must first recognize that any solution must have prime factors of 2, 3, 5, and 7 (otherwise the divisions specified in the puzzle would not yield integer results). Any larger prime factors can be shown to be unnecessary and will just yield larger values for n. Hence we can say that
Consider the first criterion. Using the expression above for n, we can say:
Now consider all of our deductions regarding a: it must be odd (if a-1 is even), and a multiple of 3, 5, and 7. The smallest value for a must be therefore be 3·5·7, or 105.
Following the same type of reasoning, we see that b must be
a multiple of 2, 5, and 7, and one more than a multiple of 3. The
smallest multiple of 2, 5, and 7 (70) has the desired characteristic
of being one more than a multiple of 3, so
Continuing, c is a multiple of 2, 3, and 7, and one more than
a multiple of 5. In this case,
Finally, we see that d is a multiple of 2, 3, and 5 and one more than a multiple of 7; 2·3·5 = 30, and the first multiple of 30 that is one more than a multiple of 7 is 4 · 30 = 120 (7·17 + 1), so we have d = 120. Putting all of these deductions together, we obtain the result at the top of this page.
The calculation of the result in long form (308,051,...) was performed in less than a tenth of a second by a program named bc (basic calculator), which (unlike most calculators) computes with arbitrary precision, using the same methods we use for pencil and paper arithmetic (except for the little bits of ground-up eraser that always end up all over the paper). The original version of bc was written at Bell Labs for Unix. The PCs in the library can run bc under Linux.