
What are primitive roots modulo n? - Mathematics Stack Exchange
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 ...
Finding a primitive root of a prime number
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
calculus - Why is "antiderivative" also known as "primitive ...
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?
lambda calculus - Show that subtraction is primitive recursive ...
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?
What is a primitive root? - Mathematics Stack Exchange
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 …
real analysis - What is the necessary and sufficient condition for …
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 ...
Derivative of square root - Mathematics Stack Exchange
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 …
Primitive polynomials - Mathematics Stack Exchange
Jul 14, 2016 · What do you call "primitive polynomial over a finite field" to, please? Could it be you actually meant "irreducible"?
Equivalent definition of primitive Dirichlet character
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 ...
number theory - Verify that $x$ is a primitive root modulo $n ...
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 ...