Skip to main content
Glasby's user avatar
Glasby's user avatar
Glasby's user avatar
Glasby
  • Member for 12 years, 7 months
  • Last seen more than a month ago
Loading…
comment
Number of primitive $n$th roots with positive versus negative real parts
Thanks Gerhard and Lucia. I think you want $D(p^k)=(-1)^k2$ for $p\equiv 3\pmod 4$. D.H. Lehmer's paper is nice: my proofs are simpler but less general too.
awarded
awarded
Loading…
awarded
answered
Loading…
comment
Efficient algorithms to determine the roots of: $p(x) = r^x $ in the finite field $GF(q)$, where $r$ a primitive root of the field
@Massimo A cyclic group of order $q-1$, such as the multiplicative group ${\mathbb F}_q\setminus\{0\}$, has $\phi(q-1)$ generators. Note that $\phi(\phi(q))=\phi(q-1)$ when $q$ is prime.
revised
Loading…
comment
Efficient algorithms to determine the roots of: $p(x) = r^x $ in the finite field $GF(q)$, where $r$ a primitive root of the field
@Noam There are $\phi(q-1)$ choices for the primitive element $r$. Could it be that the smallest value of $\deg(f)$, as $r$ varies, is ${\rm O}(\log q)$?
Loading…
Loading…
awarded
answered
Loading…
awarded
comment
How do I determine the smallest dimension of an irreducible $\mathbb{F}_p[G]$-module with a prescribed trivial fixed point space?
Burnside proved that the Sylow $p$-subgroups of $H$ are cyclic or generalized quaternion. He also incorrectly stated that $H$ must be nilpotent. See John Thompson's 1959 paper on fixed-point free automorphisms of prime order.
Loading…
revised
Loading…
Loading…
1
3 4
5
6 7