2018-02-08, 05:15 | #1 |
May 2004
2^{2}·79 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. |
Thread Tools | |
Similar Threads | ||||
Thread | Thread Starter | Forum | Replies | Last Post |
Primitive roots for a set of primes | mart_r | Math | 0 | 2013-07-20 12:23 |
Algebraic factor issues base 24 | michaf | Conjectures 'R Us | 18 | 2008-05-21 10:08 |
efficient generation of highly non-primitive roots | vector | Math | 7 | 2007-11-14 16:07 |
Primitive Roots | Numbers | Math | 16 | 2005-09-21 23:41 |
Quadratic Sieve - How large should the factor base be? | hallstei | Factoring | 5 | 2005-04-19 11:58 |