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?

Nov 12, 2016 · What would be the derivative of square roots? For example if I have $2 \\sqrt{x}$ or $\\sqrt{x}$. I'm unsure how to find the derivative of these and include them especially in …

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

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 …

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

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

Sep 21, 2020 · You'll need to complete a few actions and gain 15 reputation points before being able to upvote. Upvoting indicates when questions and answers are useful. What's reputation …