Explanation

The required number N must divide the differences of the given numbers, so N divides gcd(631−600, 724−631)=gcd(31,93)=31. Since 31 is prime, N=31, option D. Any integer leaving the same remainder on the three divisions must divide their pairwise differences, which is why the GCD yields the greatest such N.