Loading [MathJax]/jax/element/mml/optable/BasicLatin.js
 
+0  
 
0
937
1
avatar+249 

There are finitely many primes $p$ for which the congruence 8x1(modp)has no solutions $x$. Determine the sum of all such $p$.

 Aug 27, 2016
 #1
avatar+35 
0

A solution exists if and only if 8 is invertible modulo p. In other words, gcd. Since  is a power of 2, 8 is invertible modulo q if and only if q is an odd integer. All primes except for 2 are odd, so the number we are looking for is 2.

 Apr 8, 2020

3 Online Users

avatar
avatar