20071022, 15:09  #1 
Oct 2007
linköping, sweden
2^{2}·5 Posts 
primtive roots mod p^2
p=40487 is a prime number, 5 is its least positive primitve root. It is not a primitive root modulo p^2 (the least primtive root mod p^2 is 10).
p is the smallest odd prime having this property. The next smallest example is q=6692367337, found by A Paszkiewicz, possibly others. I know of no other example. Is anything known on this topic? I'm not even sure of its mathematical significance. 
20071022, 15:13  #2  
Nov 2003
2^{2}·5·373 Posts 
Quote:
such primes less than N to be about loglog N. There should be infinitely many, but they will be very very sparse. 

20071024, 06:41  #3 
Feb 2005
FC_{16} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Extracting kth roots mod m  Dubslow  Miscellaneous Math  8  20121213 21:35 
Roots of 1 mod 2^n  fenderbender  Miscellaneous Math  17  20101116 16:25 
Perfect roots  grandpascorpion  Puzzles  4  20061001 13:57 
Primitive Roots  Numbers  Math  16  20050921 23:41 
What is the roots of NFS algorithm?  Annunaki  NFSNET Discussion  7  20030729 16:01 