Jul 31, 2010 · 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 …

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

Jun 26, 2024 · 1 Based on the comments, a primitive central idempotent is a central idempotent that cannot be written as a sum of two central orthogonal idempotents. If we define that a primitive …

Nov 12, 2024 · Antipode and primitive element in a Hopf algebra Ask Question Asked 1 year, 3 months ago Modified 1 year, 3 months ago

Sep 25, 2025 · Def 1: A primitive $n$ -th root of unity is an $n$ -th root of 1 that is not an $m$ -th root of 1 for any proper divisor $m$ of $n$. This definition seems different from what I have seen elsewhere.

Mar 23, 2019 · Could you please help me solve the following problem? 2 is a primitive root mod 19. Using this information, find all solutions to x^12 ≡ 7 (mod 19) and x^12 ≡ 6 (mod 19) I think I would …

Sep 29, 2020 · The definition, given in the text, of primitive central idempotent element $e$ is if $e$ is central and has no proper decomposition as a sum of orthogonal central idempotent elements.

Mar 7, 2018 · Determine if a number is a primitive root Ask Question Asked 7 years, 11 months ago Modified 7 years, 11 months ago

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

Mar 23, 2019 · Phrased differently, you say that you know that there are $\varphi (30)=8$ primitive roots. How do you know that? The proof of that tells you how to find all the others, given one.