When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Dirichlet's theorem on arithmetic progressions - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_theorem_on...

    Although the proof of Dirichlet's Theorem makes use of calculus and analytic number theory, some proofs of examples are much more straightforward. In particular, the proof of the example of infinitely many primes of the form 4 n + 3 {\displaystyle 4n+3} makes an argument similar to the one made in the proof of Euclid's theorem (Silverman 2013).

  3. Dirichlet's approximation theorem - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_approximation...

    This theorem is a consequence of the pigeonhole principle. Peter Gustav Lejeune Dirichlet who proved the result used the same principle in other contexts (for example, the Pell equation) and by naming the principle (in German) popularized its use, though its status in textbook terms comes later. [2]

  4. Analytic number theory - Wikipedia

    en.wikipedia.org/wiki/Analytic_number_theory

    In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. [1] It is often said to have begun with Peter Gustav Lejeune Dirichlet 's 1837 introduction of Dirichlet L -functions to give the first proof of Dirichlet's theorem on arithmetic progressions .

  5. Dirichlet's unit theorem - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_unit_theorem

    In mathematics, Dirichlet's unit theorem is a basic result in algebraic number theory due to Peter Gustav Lejeune Dirichlet. [1] It determines the rank of the group of units in the ring O K of algebraic integers of a number field K. The regulator is a positive real number that determines how "dense" the units are.

  6. Dirichlet's theorem - Wikipedia

    en.wikipedia.org/wiki/Dirichlet's_theorem

    Dirichlet's theorem may refer to any of several mathematical theorems due to Peter Gustav Lejeune Dirichlet. Dirichlet's theorem on arithmetic progressions;

  7. Fundamental unit (number theory) - Wikipedia

    en.wikipedia.org/wiki/Fundamental_unit_(number...

    Dirichlet's unit theorem shows that the unit group has rank 1 exactly when the number field is a real quadratic field, a complex cubic field, or a totally imaginary quartic field. When the unit group has rank ≥ 1, a basis of it modulo its torsion is called a fundamental system of units. [1]

  8. List of number theory topics - Wikipedia

    en.wikipedia.org/wiki/List_of_number_theory_topics

    Dirichlet's theorem on arithmetic progressions. ... Note: Computational number theory is also known as algorithmic number theory. Residue number system;

  9. Glossary of number theory - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_number_theory

    Dirichlet 1. Dirichlet's theorem on arithmetic progressions 2. Dirichlet character 3. Dirichlet's unit theorem. distribution A distribution in number theory is a generalization/variant of a distribution in analysis. divisor A divisor or factor of an integer n is an integer m such that there exists an integer k satisfying n = mk. Divisors can be ...