OFFSET
1,1
PROG
(PARI) forprime(p=2, 8800, x=0; while(x<p&&x^3%p!=2%p, x++); if(x<p, y=0; while(y<p&&y^(3^2)%p!=2%p, y++); if(y==p, print1(p, ", "))))
(Magma) [p: p in PrimesUpTo(10000) | not exists{x: x in ResidueClassRing(p) | x^9 eq 2} and exists{x: x in ResidueClassRing(p) | x^3 eq 2}]; // Vincenzo Librandi, Sep 21 2012
(PARI)
ok(p, r, k1, k2)={
if ( Mod(r, p)^((p-1)/gcd(k1, p-1))!=1, return(0) );
if ( Mod(r, p)^((p-1)/gcd(k2, p-1))==1, return(0) );
return(1);
}
forprime(p=2, 10^4, if (ok(p, 2, 3, 3^2), print1(p, ", ")));
/* Joerg Arndt, Sep 21 2012 */
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Klaus Brockhaus, Apr 29 2002
STATUS
approved