|
- Finding a primitive root of a prime number
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 . . .
While antiderivative, primitive, and indefinite integral are synonymous in the United States, other languages seem not to have any equivalent terms for antiderivative As others have pointed out here How common is the use of the term "primitive" to mean "antiderivative"?, some languages such as Dutch only use the term, primitive
- What are primitive roots modulo n? - Mathematics Stack Exchange
The important fact is that the only numbers $n$ that have primitive roots modulo $n$ are of the form $2^\varepsilon p^m$, where $\varepsilon$ is either $0$ or $1$, $p$ is an odd prime, and $m\ge0$
- elementary number theory - Find all the primitive roots of $13 . . .
2 Primes have not just one primitive root, but many So you find the first primitive root by taking any number, calculating its powers until the result is 1, and if p = 13 you must have 12 different powers until the result is 1 to have a primitive root
- Show that $2$ is a primitive root modulo $13$.
I thought $\varphi (12)$ counts the number of coprimes to $12$ Why does this now suddenly tell us the number of primitive roots modulo $13$? How have these powers been plucked out of thin air? I understand even powers can't be primitive roots, also we have shown $2^3$ can't be a primitive root above but what about $2^9$?
- What is a primitive polynomial? - Mathematics Stack Exchange
9 What is a primitive polynomial? I was looking into some random number generation algorithms and 'primitive polynomial' came up a sufficient number of times that I decided to look into it in more detail I'm unsure of what a primitive polynomial is, and why it is useful for these random number generators
- number theory - How to find all primitive roots modulo 121 . . .
This question is different from this question as I want to find all primitive roots, and not just some Is my following approach correct? We have $121=11^2$, with $11$ an odd prime, and $2 \\ge
- Proof of existence of primitive roots - Mathematics Stack Exchange
Proof of existence of primitive roots Ask Question Asked 11 years, 6 months ago Modified 11 years, 6 months ago
|
|
|