About 50 results
Open links in new tab
  1. 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

  2. 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 from …

  3. Primitive positive integer solutions of $a^4 + b^4 + c^4 = d^4 + kabcd$

    Within the conventional range of $a \le b \le c \le 200$ and $d \le 1000000$, no primitive positive integer solution has been found for any of these 11 values of $k$, and constructing one using elliptic curve …

  4. Primitive and modular ideals of $C^ {\ast}$-algebras

    May 7, 2023 · So $\ker\pi$ is primitive but not modular. To find a modular ideal that is not primitive, we need to start with a unital C $^*$ -algebra (so the quotient will be unital) and consider a non …

  5. A primitive root modulo p is a primitive root modulo $p^2$ if and only ...

    Sep 25, 2022 · For what you are finally supposed to show, you now know that if $g$ is a primitive root mod $p^2$, $g^ {p-1} \not\equiv 1 \bmod p^2$ and $\textbf {vice versa}$.

  6. abstract algebra - Finding primitive element of field extension ...

    Dec 20, 2020 · Finding primitive element of field extension. Ask Question Asked 5 years, 3 months ago Modified 5 years, 3 months ago

  7. The Ackermann's function "grows faster" than any primitive recursive ...

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

  8. 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. …

  9. Are all natural numbers (except 1 and 2) part of at least one primitive ...

    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 have an even number …

  10. Equivalent definition of primitive Dirichlet character

    Mar 9, 2021 · A character is non-primitive iff it is of the form $1_ {\gcd (n,k)=1} \psi (n)$ with $\psi$ a character $\bmod m$ coprime with $k$. A character $\bmod p^2$ can be primitive with conductor $p$.