I have two positive integers and , both less than . Their product leaves a remainder of when divided by . Find the sum of all possible values of .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I only have a brute-force solution at the moment, as I have committed all possible pairs ( a , b ) to memory. Here are the integer pairs that satisfy the conditions of the problem, along with the corresponding values for a b , ( a b ) m o d 2 7 , a + b , and ( a + b ) m o d 2 7 .
The sum of the distinct entries in the ( a + b ) m o d 2 7 column is 2 + 1 1 + 1 6 + 2 5 = 5 4 .