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. …

Jul 31, 2023 · PrimitiveIdentification requires the group to be a primitive group of permutations, not just a group that can be primitive in some action. You will need to convert to a permutation group, most …

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

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" …

Apr 6, 2020 · Find all primitive roots modulo $18.$ Ask Question Asked 5 years, 11 months ago Modified 5 years, 11 months ago

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 …

Mar 9, 2015 · Primitive of $x \mapsto e^ {\sqrt {x}}$ Ask Question Asked 11 years ago Modified 11 years ago

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 …

Jul 14, 2014 · It can be proven that a primitive root modulo $n$ exists if and only if $$n \in \ { 1,2 , 4, p^k, 2 p^k \}$$ with $p$ odd prime. For each $n$ of this form there are exactly $\phi (n)$ primitive roots.

The problem/solution of counting the number of (primitive) necklaces (Lyndon words) is very well known. But what about results giving sufficient conditions for a given necklace be primitive? For ex...