%I #11 Jan 24 2024 18:28:13
%S 5,19,23,29,47,53,71,97,101,139,149,163,167,173,191,197,211,239,263,
%T 269,293,311,317,359,379,383,389,409,431,461,479,499,503,509,557,599,
%U 643,647,653,677,701,719,743,773,797,821,839,859,863,887,907,941,983
%N Primes modulo which the multiplicative orders of 2 and 3 are equal.
%H Robert Israel, <a href="/A191609/b191609.txt">Table of n, a(n) for n = 1..10000</a>
%p select(p -> isprime(p) and numtheory:-order(2,p) = numtheory:-order(3,p), [seq(i,i=5..10000,2)]); # _Robert Israel_, Jan 24 2024
%o (PARI) forprime(p=5,10^3, if( znorder(Mod(2,p))==znorder(Mod(3,p)), print1(p,", ");) )
%Y Cf. A123988, A127437, A127438.
%K nonn,easy
%O 1,1
%A _Max Alekseyev_, Jun 08 2011
|