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 …

Here's a proof showing why Ackermann's function is not primitive recursive. The key to showing that A is not primitive recursive, is to find a properties shared by all primitive recursive …

How to find all primitive triples (a,b,c)? (Pythagorean Triples) Ask Question Asked 10 years, 8 months ago Modified 5 years, 8 months ago

I have to list the quadratic residues of $17$ and find a primitive root. I have calculated that: Quadratic residues $\\text{mod 17}$ are $1,2,4,8,9,13,15,16.$ How am I then meant to use …

Then, primitive recursive functions can be reduced to relations? And, in defining the p.r. functions he uses logical operators that i thought were available only inside the logical system. So, the …

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

The proof of the primitive element theorem may yield the primitive element $\sqrt 2 +\sqrt 3+\sqrt 5$, depending on how it's proved.

A nonnegative, irreducible matrix is primitive if and only if it is aperiodic (ibid. Theorem 8.5.3). According to this source, we wouldn't ever call a reducible matrix primitive. Though a reducible …

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? …

Leaving field theory again, if we consider the different complex roots of the polynomials $\alpha_i$ (excluding non-primitive root $1$, we would have $1\leq i \leq p-1$).