About the Project

Euler pentagonal number theorem

AdvancedHelp

(0.002 seconds)

31—40 of 539 matching pages

31: 19.11 Addition Theorems
§19.11 Addition Theorems
γ = ( ( csc 2 θ ) α 2 ) ( ( csc 2 ϕ ) α 2 ) ( ( csc 2 ψ ) α 2 ) ,
19.11.6_5 R C ( γ δ , γ ) = 1 δ arctan ( δ sin θ sin ϕ sin ψ α 2 1 α 2 cos θ cos ϕ cos ψ ) .
γ = ( 1 α 2 ) ( ( csc 2 θ ) α 2 ) ( ( csc 2 ϕ ) α 2 ) ,
γ = ( ( csc 2 θ ) α 2 ) 2 ( ( csc 2 ψ ) α 2 ) ,
32: 25.15 Dirichlet L -functions
For the principal character χ 1 ( mod k ) , L ( s , χ 1 ) is analytic everywhere except for a simple pole at s = 1 with residue ϕ ( k ) / k , where ϕ ( k ) is Euler’s totient function (§27.2). …
25.15.5 L ( 1 s , χ ) = k s 1 Γ ( s ) ( 2 π ) s ( e π i s / 2 + χ ( 1 ) e π i s / 2 ) G ( χ ) L ( s , χ ¯ ) ,
This result plays an important role in the proof of Dirichlet’s theorem on primes in arithmetic progressions (§27.11). Related results are:
25.15.10 L ( 0 , χ ) = { 1 k r = 1 k 1 r χ ( r ) , χ χ 1 , 0 , χ = χ 1 .
33: 5.5 Functional Relations
5.5.1 Γ ( z + 1 ) = z Γ ( z ) ,
5.5.3 Γ ( z ) Γ ( 1 z ) = π / sin ( π z ) , z 0 , ± 1 , ,
5.5.5 Γ ( 2 z ) = π 1 / 2 2 2 z 1 Γ ( z ) Γ ( z + 1 2 ) .
§5.5(iv) Bohr–Mollerup Theorem
If a positive function f ( x ) on ( 0 , ) satisfies f ( x + 1 ) = x f ( x ) , f ( 1 ) = 1 , and ln f ( x ) is convex (see §1.4(viii)), then f ( x ) = Γ ( x ) .
34: 31.14 General Fuchsian Equation
The general second-order Fuchsian equation with N + 1 regular singularities at z = a j , j = 1 , 2 , , N , and at , is given by …The exponents at the finite singularities a j are { 0 , 1 γ j } and those at are { α , β } , where …The three sets of parameters comprise the singularity parameters a j , the exponent parameters α , β , γ j , and the N 2 free accessory parameters q j . With a 1 = 0 and a 2 = 1 the total number of free parameters is 3 N 3 . …
31.14.3 w ( z ) = ( j = 1 N ( z a j ) γ j / 2 ) W ( z ) ,
35: 27.21 Tables
§27.21 Tables
Glaisher (1940) contains four tables: Table I tabulates, for all n 10 4 : (a) the canonical factorization of n into powers of primes; (b) the Euler totient ϕ ( n ) ; (c) the divisor function d ( n ) ; (d) the sum σ ( n ) of these divisors. Table II lists all solutions n of the equation f ( n ) = m for all m 2500 , where f ( n ) is defined by (27.14.2). …6 lists ϕ ( n ) , d ( n ) , and σ ( n ) for n 1000 ; Table 24. …
36: 25.2 Definition and Expansions
where the Stieltjes constants γ n are defined via …
§25.2(iii) Representations by the Euler–Maclaurin Formula
25.2.8 ζ ( s ) = k = 1 N 1 k s + N 1 s s 1 s N x x x s + 1 d x , s > 0 , N = 1 , 2 , 3 , .
For B 2 k see §24.2(i), and for B ~ n ( x ) see §24.2(iii). … product over zeros ρ of ζ with ρ > 0 (see §25.10(i)); γ is Euler’s constant (§5.2(ii)).
37: 25.1 Special Notation
k , m , n nonnegative integers.
p prime number.
γ Euler’s constant (§5.2(ii)).
ψ ( x ) digamma function Γ ( x ) / Γ ( x ) except in §25.16. See §5.2(i).
B n , B n ( x ) Bernoulli number and polynomial (§24.2(i)).
38: 5.18 q -Gamma and q -Beta Functions
5.18.5 Γ q ( 1 ) = Γ q ( 2 ) = 1 ,
5.18.7 Γ q ( z + 1 ) = 1 q z 1 q Γ q ( z ) .
Also, ln Γ q ( x ) is convex for x > 0 , and the analog of the Bohr–Mollerup theorem5.5(iv)) holds. … For generalized asymptotic expansions of ln Γ q ( z ) as | z | see Olde Daalhuis (1994) and Moak (1984). For the q -digamma or q -psi function ψ q ( z ) = Γ q ( z ) / Γ q ( z ) see Salem (2013). …
39: Karl Dilcher
Dilcher’s research interests include classical analysis, special functions, and elementary, combinatorial, and computational number theory. Over the years he authored or coauthored numerous papers on Bernoulli numbers and related topics, and he maintains a large on-line bibliography on the subject. …
  • 40: 25.10 Zeros
    Also, ζ ( s ) 0 for s = 1 , a property first established in Hadamard (1896) and de la Vallée Poussin (1896a, b) in the proof of the prime number theorem (25.16.3). …
    25.10.2 ϑ ( t ) ph Γ ( 1 4 + 1 2 i t ) 1 2 t ln π
    is chosen to make Z ( t ) real, and ph Γ ( 1 4 + 1 2 i t ) assumes its principal value. … Riemann developed a method for counting the total number N ( T ) of zeros of ζ ( s ) in that portion of the critical strip with 0 < t < T . By comparing N ( T ) with the number of sign changes of Z ( t ) we can decide whether ζ ( s ) has any zeros off the line in this region. …