
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 …
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
Are all natural numbers (except 1 and 2) part of at least one …
Nov 5, 2025 · 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 …
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 …
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 …
Proof of existence of primitive roots - Mathematics Stack Exchange
Proof of existence of primitive roots Ask Question Asked 11 years, 5 months ago Modified 11 years, 5 months ago
The primitive $n^ {th}$ roots of unity form basis over $\mathbb {Q ...
Apr 10, 2024 · We fix the primitive roots of unity of order $7,11,13$, and denote them by $$ \tag {*} \zeta_7,\zeta_ {11},\zeta_ {13}\ . $$ Now we want to take each primitive root of prime order …
complex analysis - Do holomorphic functions have primitive ...
Mar 16, 2022 · Do holomorphic functions have primitive? Ask Question Asked 3 years, 8 months ago Modified 3 years, 8 months ago
Primitive Roots mod a prime number - Mathematics Stack Exchange
Example of searching another primitive root. $3$ is a primitive root modulo $7$ and $\phi (7)=6$. Thus $3^5=5$ modulo $7$ is the only other p.r. because $2,3,4,6$ are not coprime with $6$ …
elementary number theory - Prove if $n$ has a primitive root, then …
Thus there is a bijection between the set of primitive roots and the set of positive integers less than $\phi (n)$ and coprime to it, of which there are $\phi (\phi (n))$.