Find the sum of all solutions to
where is an integer satisfying .
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.
Relevant wiki: Modular Arithmetic - Problem Solving - Basic
For a number to be 0 m o d 1 2 8 , 1 2 8 must divide that number. For 1 2 8 to divide a number, the number must have 2 7 in its prime factorization. Note that squaring a number does not change its prime factorization, it simply doubles the powers of the primes. Therefore, n must include 2 4 in its prime factorization. Other solutions will simply be multiples of 2 4 , as 1 2 8 has no primes other than 2 in its prime factorization. Taking the sum of all multiples of 2 4 that are < 1 2 8 :
2 4 ( 1 + 2 + 3 + 4 + 5 + 6 + 7 )
2 4 ( 2 8 )
4 4 8