Building row by row keeps every intermediate value a real binomial coefficient, so the factorials never appear: 21! already passes a signed 64-bit integer, while C(21, 10) is only 352716. What the method does not dodge is the rest of the row. Asking for C(67, 2) still builds all of row 67, and its middle entry C(67, 33) is 14226520737620288370, past 2^63 - the ceiling is the largest entry in the row, not the answer you asked for. The IntArray above hits its own ceiling far sooner, at row 34, where C(34, 17) is 2333606220 and passes 2^31. Beyond the range you work modulo a prime, and then you cannot divide by k! at all, which is why the modular inverse and the triangle sit on the same page.