0
I have n pairs of numbers: { p[1], s[1] }, { p[2], s[2] }, ... , { p[n], s[n] }
Where p[i] is integer greater than 1; s[i] is integer : 0 <= s[i] <= p[i]
Is there any way to determine minimum positive integer a , such that for each pair :
( s[i] + a ) mod p[i] != 0
Anything better than brute...