I'm trying to understand what primitive roots are for a given $\bmod\ n$. Wolfram's definition is as follows: A primitive root of a prime $p$ is an integer $g$ such ...

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

Jan 6, 2019 · If I had to guess, I would say that calling the antiderivative as primitive is of French origin. Is one term more popular than the other?

Jul 23, 2018 · So I encountered this proof on a Number Theory book, I will link the pdf at the end of the post (proof at page 96), it says: "Every prime has a primitive root, proof: Let p be a …

Nov 18, 2016 · I read about irreducible polynomial, primitive polynomial and minimal polynomial and now i am not able to differentiate between them, its chaos in my mind. Can somebody …

Jul 14, 2016 · What do you call "primitive polynomial over a finite field" to, please? Could it be you actually meant "irreducible"?

Prove if $n$ has a primitive root, then it has exactly $\phi (\phi (n))$ of them. Let $a$ be the primitive root then I know other primitive roots will be among $\ {a ...

Dec 12, 2022 · I have noticed that you have been asking countless questions within the "lambda calculus" tag, and have not been accepting or commenting on any of the answers. Why is that?

Jun 6, 2016 · My quick & dirty method was to note that $13-1=12$ has prime factors $2,3$ & quickly find squares and cubes of a numbers, since those cannot be primitive roots, and not …

May 18, 2021 · Instead of "if gcd (modulo, num)" you should use "if gcd (modulo, num) == 1". This works for 6 on my machine, correctly predicting that mod 6 the only primitive root is 5. Your …