About 50 results
Open links in new tab
  1. calculus - Why is "antiderivative" also known as "primitive ...

    Jan 6, 2019 · The so-called primitive function f f, which was the starting point and so came first, the root meaning of primitive (Lat. primus, first), is what we might call an antiderivative or …

  2. Finding a primitive root of a prime number

    Jan 3, 2015 · 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

  3. What are primitive roots modulo n? - Mathematics Stack Exchange

    I'm trying to understand what primitive roots are for a given mod n mod n. Wolfram's definition is as follows: A primitive root of a prime p p is an integer g g such that g (mod p) g (mod p) has …

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

  5. When are Idempotents elements of a semisimple algebra primitive

    Jun 26, 2024 · At least in the context of group algebras over C C primitive central idempotent means that such an idempotent cannot be written as a sum of two orthogonal central …

  6. Primitive subgroup of $ SU_n - Mathematics Stack Exchange

    Jun 9, 2022 · A maximal closed subgroup of SUn S U n is (almost) always primitive, see Properties of primitive matrix groups for the exception. And in particular a maximal closed …

  7. Primitive Roots modulo p - Mathematics Stack Exchange

    I'm asked the following question: Prove that b b is a primitive root modulo p p the smallest positive exponent e e such that be ≡ 1 (mod p) b e ≡ 1 (mod p) is p − 1 p 1. I know that this could …

  8. primitive idempotents in semisimple rings - Mathematics Stack …

    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 …

  9. Primitive roots modulo n - Mathematics Stack Exchange

    Jul 14, 2014 · It can be proven that a primitive root modulo $n$ exists if and only if $$n \in \ { 1,2 , 4, p^k, 2 p^k \}$$ with $p$ odd prime. For each $n$ of this form there are exactly $\phi (n)$ …

  10. Generating primitive Pythagorean triples - Mathematics Stack …

    Oct 18, 2020 · Every non-primitive pythagorean triple is a multiple of a primitive pythogorean triple. So, if we know the primitive ones, we basically know them all. a2 +b2 =c2 − k a 2 + b 2 …