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?

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?

Sep 1, 2015 · I have read that, but essentially what I want to know is, can a primitive root be defined in a simpler, easier to understand way? For my level of mathematics, some of the …

Let $f$ be a function defined on $[a,b]$. Now, under what condition does a primitive of f exists and if it exists how do we find it and its domain? I think, if $f$ is ...

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

Mar 9, 2021 · Thanks a lot for the answer! For the last paragraph I think it is a difference in the convention: My text directly defines a Dirichlet character $\mod q$ is primitive ...

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 …

I have a question. How can we the quickest to test whether $x$ is a primitive root modulo $n$? On the Wikipedia page I found information about a possible algorithm ...