calculus - Why is "antiderivative" also known as "primitive ...
Jan 6, 2019 · 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 …
What are primitive roots modulo n? - Mathematics Stack Exchange
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 …
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
elementary number theory - Find all the primitive roots of $13 ...
Jun 6, 2016 · 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 …
Are all natural numbers (except 1 and 2) part of at least one …
6 days ago · Hence, all odd numbers are included in at least one primitive triplet. Except 1, because I'm not allowing 0 to be a term in a triplet. I can't think of any primitive triplets that …
Proof that if $n$ has a primitive root, $x^k \equiv a \pmod n$ has …
Aug 28, 2024 · Let $n$ be a positive integer that has a primitive root (in other word for which the multiplicative group modulo $n$ is cyclic). Proof of k'th power theorem: $x^k ...
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 …
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 …
Ian Stewart, Definition for Primitive Root of Unity
Sep 25, 2025 · Def 1: A primitive $n$ -th root of unity is an $n$ -th root of 1 that is not an $m$ -th root of 1 for any proper divisor $m$ of $n$. This definition seems different from what I have …
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 …