von Staudt–Clausen theorem
(0.001 seconds)
11—20 of 130 matching pages
11: Bibliography M
…
►
Formulas and Theorems for the Special Functions of Mathematical Physics.
3rd edition, Springer-Verlag, New York-Berlin.
…
►
Über die asymptotische Entwicklung von
, für große Werte von
und . I, II.
Proc. Akad. Wet. Amsterdam 35, pp. 1170–1180, 1291–1303 (German).
…
►
A -analog of the summation theorem for hypergeometric series well-poised in
.
Adv. in Math. 57 (1), pp. 14–33.
…
►
A -analog of the Gauss summation theorem for hypergeometric series in
.
Adv. in Math. 72 (1), pp. 59–131.
…
►
Balanced summation theorems for basic hypergeometric series.
Adv. Math. 131 (1), pp. 93–187.
…
12: Bibliography
…
►
Numerik: Implementierung von Zylinderfunktionen.
Elektrotechnik, Friedr. Vieweg & Sohn, Braunschweig-Wiesbaden.
…
►
Characterization theorems for orthogonal polynomials.
In Orthogonal Polynomials (Columbus, OH, 1989),
NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., Vol. 294, pp. 1–24.
…
►
Monotonicity theorems and inequalities for the complete elliptic integrals.
J. Comput. Appl. Math. 172 (2), pp. 289–312.
…
►
Theorems on generalized Dedekind sums.
Pacific J. Math. 2 (1), pp. 1–9.
…
►
A Centennial History of the Prime Number Theorem.
In Number Theory,
Trends Math., pp. 1–14.
…
13: Bibliography D
…
►
Note on the addition theorem of parabolic cylinder functions.
J. Indian Math. Soc. (N. S.) 4, pp. 29–30.
…
►
Ramanujan’s master theorem for symmetric cones.
Pacific J. Math. 175 (2), pp. 447–490.
…
►
Beweis des Satzes, dass jede unbegrenzte arithmetische Progression, deren erstes Glied und Differenz ganze Zahlen ohne gemeinschaftlichen Factor sind, unendlich viele Primzahlen enthält.
Abhandlungen der Königlich Preussischen Akademie der
Wissenschaften von 1837, pp. 45–81 (German).
►
Über die Bestimmung der mittleren Werthe in der Zahlentheorie.
Abhandlungen der Königlich Preussischen Akademie der
Wissenschaften von 1849, pp. 69–83 (German).
…
►
On Vandermonde’s theorem, and some more general expansions.
Proc. Edinburgh Math. Soc. 25, pp. 114–132.
…
14: 25.19 Tables
…
►
•
…
►
•
►
•
Fletcher et al. (1962, §22.1) lists many sources for earlier tables of for both real and complex . §22.133 gives sources for numerical values of coefficients in the Riemann–Siegel formula, §22.15 describes tables of values of , and §22.17 lists tables for some Dirichlet -functions for real characters. For tables of dilogarithms, polylogarithms, and Clausen’s integral see §§22.84–22.858.
15: Bibliography B
…
►
Abelian Functions: Abel’s Theorem and the Allied Theory of Theta Functions.
Cambridge University Press, Cambridge.
…
►
Waves and Thom’s theorem.
Advances in Physics 25 (1), pp. 1–26.
…
►
II. Darstellung von Funktionen in Rechenautomaten.
In Mathematische Hilfsmittel des Ingenieurs. Teil III, R. Sauer and I. Szabó (Eds.),
…
16: Bibliography J
…
►
Fundamenta Nova Theoriae Functionum Ellipticarum.
Regiomonti, Sumptibus fratrum Bornträger.
…
17: Bibliography V
…
►
Über die Riemann’sche Primzahlfunction.
Math. Ann. 55, pp. 441–464 (German).
…
18: Bibliography H
…
►
Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl Potenzen (Waringsches Problem).
Nachrichten von der Gesellschaft der Wissenschaften
zu Göttingen, Mathematisch-Physikalische Klasse, pp. 17–36 (German).
…
►
Algorithm 571: Statistics for von Mises’ and Fisher’s distributions of directions: , and their inverses [S14].
ACM Trans. Math. Software 7 (2), pp. 233–238.
…
19: 27.15 Chinese Remainder Theorem
§27.15 Chinese Remainder Theorem
►The Chinese remainder theorem states that a system of congruences , always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod ), where is the product of the moduli. ►This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …By the Chinese remainder theorem each integer in the data can be uniquely represented by its residues (mod ), (mod ), (mod ), and (mod ), respectively. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result , which is correct to 20 digits. …20: 25.21 Software
…
►