• In algebra, Gauss's lemma, named after Carl Friedrich Gauss, is a theorem about polynomials over the integers, or, more generally, over a unique factorization...
    23 KB (3,962 words) - 16:23, 11 March 2025
  • Gauss's lemma can mean any of several mathematical lemmas named after Carl Friedrich Gauss: Gauss's lemma (polynomials), the greatest common divisor of...
    574 bytes (99 words) - 19:46, 16 September 2023
  • Brahmagupta polynomials Caloric polynomial Charlier polynomials Chebyshev polynomials Chihara–Ismail polynomials Cyclotomic polynomials Dickson polynomial Ehrhart...
    5 KB (441 words) - 01:35, 1 December 2023
  • Thumbnail for List of things named after Carl Friedrich Gauss
    or Gaussian method Gauss–Jordan elimination Gauss–Seidel method Gauss's cyclotomic formula Gauss's lemma in relation to polynomials Gaussian binomial coefficient...
    14 KB (1,117 words) - 16:38, 23 January 2025
  • Thumbnail for Carl Friedrich Gauss
    Ewald, Gauss's son-in-law, and Wolfgang Sartorius von Waltershausen, Gauss's close friend and biographer, gave eulogies at his funeral. Gauss was a successful...
    181 KB (17,929 words) - 00:52, 14 May 2025
  • mathematics, Bézout's identity (also called Bézout's lemma), named after Étienne Bézout who proved it for polynomials, is the following theorem: Bézout's identity—Let...
    12 KB (1,680 words) - 04:03, 20 February 2025
  • Rational root theorem (category Theorems about polynomials)
    is a special case (for a single linear factor) of Gauss's lemma on the factorization of polynomials. The integral root theorem is the special case of...
    10 KB (1,527 words) - 23:07, 16 May 2025
  • theory) Zassenhaus lemma Gauss's lemma (polynomials) Schwartz–Zippel lemma Artin–Rees lemma Hensel's lemma (commutative rings) Nakayama lemma Noether's normalization...
    8 KB (525 words) - 21:03, 22 April 2025
  • non-constant polynomials are exactly the polynomials that are non-invertible and non-zero. Another definition is frequently used, saying that a polynomial is irreducible...
    20 KB (2,852 words) - 00:22, 27 January 2025
  • Taylor, Paul (2 June 2007), Gauss's second proof of the fundamental theorem of algebra – English translation of Gauss's second proof. van der Waerden...
    51 KB (7,637 words) - 19:14, 19 May 2025
  • polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials. The original use of interpolation polynomials was...
    47 KB (9,027 words) - 21:42, 3 April 2025
  • Poincaré lemma helps in finding such potentials when the magnetic field is "well-behaved" (i.e., when the magnetic field is not due to a monopole), Gauss's law...
    29 KB (5,411 words) - 11:17, 4 May 2025
  • especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates (traditionally...
    54 KB (8,646 words) - 23:30, 31 May 2025
  • symmetric polynomials Fundamental theorem of topos theory Fundamental theorem of ultraproducts Fundamental theorem of vector analysis Carl Friedrich Gauss referred...
    5 KB (553 words) - 13:53, 14 September 2024
  • the product of non-constant polynomials with rational coefficients. This criterion is not applicable to all polynomials with integer coefficients that...
    25 KB (3,592 words) - 08:27, 14 March 2025
  • primitive part by the inverse of this unit. Gauss's lemma implies that the product of two primitive polynomials is primitive. It follows that primpart ⁡...
    52 KB (7,886 words) - 23:12, 24 May 2025
  • multivariate polynomials to that of univariate polynomials does not have any specificity in the case of coefficients in a finite field, only polynomials with...
    30 KB (4,620 words) - 13:48, 7 May 2025
  • A polynomial is primitive if its content equals 1. Thus the primitive part of a polynomial is a primitive polynomial. Gauss's lemma for polynomials states...
    11 KB (1,725 words) - 14:08, 5 March 2023
  • primitive part. Gauss proved that the product of two primitive polynomials is also primitive (Gauss's lemma). This implies that a primitive polynomial is irreducible...
    28 KB (4,408 words) - 18:11, 24 May 2025
  • ^{7}-x^{6}-x^{5}+x^{2}+x+1.\end{aligned}}} The cyclotomic polynomials are monic polynomials with integer coefficients that are irreducible over the field...
    31 KB (5,525 words) - 08:24, 8 April 2025
  • positive integers n. It is hard to approximate it by a single smooth polynomial. The Gauss–Kuzmin–Wirsing operator G {\displaystyle G} acts on functions f...
    17 KB (3,078 words) - 03:26, 27 May 2025
  • Thumbnail for Quadratic reciprocity
    follow from cases 1) - 8). Gauss needed, and was able to prove, a lemma similar to the one Legendre needed: Gauss's Lemma. If p is a prime congruent to...
    111 KB (8,566 words) - 03:50, 12 March 2025
  • Thumbnail for Fundamental theorem of arithmetic
    for the first time the fundamental theorem of arithmetic. Article 16 of Gauss's Disquisitiones Arithmeticae is an early modern statement and proof employing...
    22 KB (3,213 words) - 15:18, 18 May 2025
  • Thumbnail for Chinese remainder theorem
    case of Chinese remainder theorem for polynomials is Lagrange interpolation. For this, consider k monic polynomials of degree one: P i ( X ) = X − x i ...
    43 KB (7,239 words) - 03:37, 18 May 2025
  • Perron's irreducibility criterion (category Polynomials)
    the product of lower-degree polynomials with integer coefficients. This criterion is applicable only to monic polynomials. However, unlike other commonly...
    4 KB (552 words) - 19:35, 8 August 2024
  • Thumbnail for Descartes' rule of signs
    Descartes' rule of signs (category Theorems about polynomials)
    the fastest algorithms today for computer computation of real roots of polynomials (see real-root isolation). Descartes himself used the transformation...
    10 KB (1,797 words) - 00:18, 1 June 2025
  • Thumbnail for Rolle's theorem
    In calculus, Rolle's theorem or Rolle's lemma essentially states that any real-valued differentiable function that attains equal values at two distinct...
    16 KB (2,015 words) - 13:24, 26 May 2025
  • of transcendence degree. Many of these simple proofs use Gauss's lemma on primitive polynomials as a main step. Burau, Werner (2008), "Lueroth (or Lüroth)...
    3 KB (280 words) - 16:18, 23 October 2023
  • Thumbnail for Number theory
    is actually much later than Fermat's; it first appears in section 1 of Gauss's Disquisitiones Arithmeticae. Fermat's little theorem is a consequence of...
    95 KB (12,176 words) - 05:50, 1 June 2025
  • {g}}]} denote the algebra of C {\displaystyle \mathbb {C} } -valued polynomials on g {\displaystyle {\mathfrak {g}}} (exactly the same argument works...
    15 KB (2,782 words) - 06:37, 9 March 2025