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

Jul 31, 2010 · 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 …

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 seen elsewhere.

May 6, 2015 · A primitive element of a free group is an element of some basis of the free group. I have seen some recent papers on algorithmic problems concerning primitive elements of free groups, for …

Apr 10, 2015 · The "grows faster" argument accomplishes this. If the Ackermann function grows faster than any primitive recursive function, it doesn't equal any of them. In order to make the "grows faster" …

Jan 28, 2017 · Artin-Wedderburn matrix decomposition holds for every semisimple ring. The first chapter of T.Y. Lam's book "A first course in noncommutative rings" should have everything you need.

The problem/solution of counting the number of (primitive) necklaces (Lyndon words) is very well known. But what about results giving sufficient conditions for a given necklace be primitive? For ex...

Feb 3, 2022 · Primitive element theorem: an example Ask Question Asked 4 years ago Modified 4 years ago

An integer sided triangle $ (a,b,c)$ is called primitive if $\gcd (a,b,c)=1$. How many primitive integer-sided triangles exist with a perimeter not exceeding $10 000 000$? I am trying to solve this on Euler …

Oct 9, 2023 · We know the sum of all primitive n-th roots of unity is the Möbius function, as shown in this question. $$ \sum_ {\substack {k=1 \newline (k,n)=1}}^n {\mathrm {e}^ {i\frac {2\pi k} {n}}}=\mu (n) $$ …