arithmetic progression
♦
5 matching pages ♦
(0.000 seconds)
5 matching pages
1: 27.11 Asymptotic Formulas: Partial Sums
…
►where , .
►Letting in (27.11.9) or in (27.11.11) we see that there are infinitely many primes if are coprime; this is Dirichlet’s theorem
on primes in arithmetic progressions.
…
►The prime number theorem for
arithmetic progressions—an extension of (27.2.3) and first proved in de la Vallée Poussin (1896a, b)—states that if , then the number of primes with is asymptotic to as .
2: 25.15 Dirichlet -functions
…
►This result plays an important role in the proof of Dirichlet’s theorem on primes in arithmetic progressions (§27.11).
Related results are:
…
3: 1.2 Elementary Algebra
…
►
Arithmetic Progression
…4: Bibliography P
…
►
Complex Interval Arithmetic and its Applications.
Mathematical Research, Vol. 105, Wiley-VCH Verlag Berlin GmbH, Berlin.
…
►
Notes on Introductory Combinatorics.
Progress in Computer Science, Vol. 4, Birkhäuser Boston Inc., Boston, MA.
…
5: Bibliography K
…
►
Algorithm 763: INTERVAL_ARITHMETIC: A Fortran 90 module for an interval data type.
ACM Trans. Math. Software 22 (4), pp. 385–392.
…
►
Algorithm 910: a portable C++ multiple-precision system for special-function calculations.
ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.
…
►
Rays and caustics as physical objects.
In Progress in Optics, E. Wolf (Ed.),
Vol. 26, pp. 227–348.
…