#
#  This number exercises the addBack( ) function in the 
#  division algorithm.
#
#  Knuth says that it is very hard to generate test cases
#  for this function.  This number was found accidently.
#
#  In this case, the number was found by trying to calculate
#  x % n, where the result turned out to be n - 1 (i.e. 
#  -1 mod n).  Is it possible that this class of calculations
#  always triggers this function?  Or at least triggers
#  it with greater probability?
#
divide 105750565023358503308790633168 85896997865408466491 1231132258 85896997865408466490