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

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 and how do I …

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 want to show that subtraction is primitive recursive: $subtract(x,y)=x-y$. To do this, I must first show that pred function: $pred(x)=x-1$ is also 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 …

Aug 10, 2015 · Jyrki, I know that, but what extension are we talking about here? If the OP really wanted that then any irreducible polynomial over some field $\,\Bbb F\,$ with a root $\,w\,$ in …

Mar 7, 2018 · Let $p$ be an odd prime, let $g$ be a primitive root of $p$. Prove $-g$ is a primitive root of $p$ if and only if $$p\\equiv1\\pmod{4}$$ Hint: express $-g$ as $g^{k ...

Sep 1, 2015 · So I'm trying to learn about RSA and have come across various subtopics, including the discrete logarithm problem. This mentions primitive roots, which I do not understand. …

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 …

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 …