Given an array of N integers.
a[1]%K = a[2]%K = a[3]%K = … a[n]%K

1<K<N, 1< N<10^6, 1<a[i]<10^9

How will you find all possible values for K?
P.S : No brute force approach.
Given an array of N integers.
a[1]%K = a[2]%K = a[3]%K = … a[n]%K
1<K<N, 1< N<10^6, 1<a[i]<10^9
How will you find all possible values for K?
P.S : No brute force approach.
Can you please give some Q link? People need it to verify that this isnt related to an ongoing contest. I will be happy to help after that
Thanks!!
Hint: if a_1 \text{ mod } K = a_2 \text{ mod } K, then (a_1  a_2) \text{ mod } K = 0. Therefore K has to be a divisor of a_1  a_2.