The size of the smallest herd that could satisfy both the first and second parts of the problem is then given by j = 1, and is about 7.76 × 10 206544 {\displaystyle 7.76\times 10^{206544}} (first solved by Amthor). Modern computers can easily print out all digits of the answer. This was first done at the University of Waterloo, in 1965 by Hugh C. Williams, R. A. German, and Charles Robert Zarnke.