Dudeney’s Remainder Problem – Win Vector LLC

d is now a proper divisor of these new integers. We have eliminated the unknown shared remainder. And, with quantities related to zero, we have a lot more opportunities for cancellation. The problem is now solvable by a classic algorithm.

The largest solution to this is the greatest common divisor, written as gcd(508811 - 480608, 723217 - 480608). All other solutions are proper divisors of this greatest common divisor.

Leave a Comment