mersenneforum.org > Math primitive roots- when the base is a quadratic algebraic integer
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

 2018-02-08, 05:15 #1 devarajkandadai     May 2004 4748 Posts primitive roots- when the base is a quadratic algebraic integer As members are aware we had to modify Fermat's theorem in order to accommodate quadratic algebraic integers as bases ( see thread: conjecture pertaining to modified Fermat's theorem ). The modified theorem: a^(p^2-1) = = 1(mod(p)). This is subject to conditions mentioned in the thread. Now naturally the concept of primitive roots in this context arises. We can now say that a is a primitive root of m if a^(eulerphi(m^2)) = = 1 subject to i) m is coprime with norm of a ii) m is coprime with the discriminant iii) a^k is not congruent to 1 (mod p) where k is any rational integer less than eulerphi(p^2-1) Here, of course, a is a quadratic algebraic integer. In my next post will give examples.

 Similar Threads Thread Thread Starter Forum Replies Last Post mart_r Math 0 2013-07-20 12:23 michaf Conjectures 'R Us 18 2008-05-21 10:08 vector Math 7 2007-11-14 16:07 Numbers Math 16 2005-09-21 23:41 hallstei Factoring 5 2005-04-19 11:58

All times are UTC. The time now is 13:16.

Tue Dec 7 13:16:53 UTC 2021 up 137 days, 7:45, 0 users, load averages: 1.27, 1.22, 1.37