|
%I #10 Feb 19 2014 17:57:08
%S 7,13,17,19,23,29,31,37,41,43,47,61,67,71,73,79,89,97,101,103,109,113,
%T 127,131,137,139,149,151,157,163,167,173,181,191,193,197,199,211,223,
%U 229,233,239,241,251,257,263,271,277,281,283,307,311,313,331,337
%N Primes p such that x^x == x (mod p) for some number x with 1 < x < p.
%C Complement of A065296.
%H T. D. Noe, <a href="/A233518/b233518.txt">Table of n, a(n) for n = 1..1000</a>
%H Pär Kurlberg, Florian Luca, and Igor Shparlinski, <a href="http://arxiv.org/abs/1402.4464">On the fixed points of the map x -> x^x modulo a prime</a>, arX1v 1402.4464
%t fQ[p_] := Min[Table[Mod[PowerMod[x, x, p] - x, p], {x, 2, p - 1}]] == 0; Select[Prime[Range[2, 100]], fQ[#] &]
%Y Cf. A065295, A065296, A233519, A233520.
%K nonn
%O 1,1
%A _T. D. Noe_, Feb 18 2014
|
