What is a primitive polynomial? - Mathematics Stack Exchange
9 What is a primitive polynomial? I was looking into some random number generation algorithms and 'primitive polynomial' came up a sufficient number of times that I decided to look into it in more detail. …
Finding a primitive root of a prime number
May 16, 2023 · How would you find a primitive root of a prime number such as 761? How do you pick the primitive roots to test? Randomly? Thanks
What is a free group element that is not primitive?
May 6, 2015 · A primitive element of a free group is an element of some basis of the free group. I have seen some recent papers on algorithmic problems concerning primitive elements of free groups, for …
elementary number theory - Find all primitive roots modulo $18 ...
Apr 6, 2020 · Find all primitive roots modulo $18.$ Ask Question Asked 5 years, 11 months ago Modified 5 years, 11 months ago
Are all natural numbers (except 1 and 2) part of at least one primitive ...
Nov 5, 2025 · Hence, all odd numbers are included in at least one primitive triplet. Except 1, because I'm not allowing 0 to be a term in a triplet. I can't think of any primitive triplets that have an even number …
Primitive of $x \mapsto e^ {\sqrt {x}}$ - Mathematics Stack Exchange
Mar 9, 2015 · Primitive of $x \mapsto e^ {\sqrt {x}}$ Ask Question Asked 11 years ago Modified 11 years ago
Basis of primitive nth Roots in a Cyclotomic Extension?
Another method to show the "only if " direction is to use the fact that the trace of $\zeta_n$ is equal to zero if n is not square free, while by definition, the trace of $\zeta_n$ in this case is exactly the same …
The Ackermann's function "grows faster" than any primitive recursive ...
Apr 10, 2015 · The "grows faster" argument accomplishes this. If the Ackermann function grows faster than any primitive recursive function, it doesn't equal any of them. In order to make the "grows faster" …
Primitive $6^ {th}$ root of unity - Mathematics Stack Exchange
Dec 2, 2016 · Primitive $6^ {th}$ root of unity Ask Question Asked 9 years, 3 months ago Modified 9 years, 3 months ago
A primitive root modulo p is a primitive root modulo $p^2$ if and only ...
Sep 25, 2022 · For what you are finally supposed to show, you now know that if $g$ is a primitive root mod $p^2$, $g^ {p-1} \not\equiv 1 \bmod p^2$ and $\textbf {vice versa}$.