About the Project

functions s(ϵ,ℓ;r),c(ϵ,ℓ;r)

AdvancedHelp

(0.024 seconds)

11—20 of 570 matching pages

11: 27.20 Methods of Computation: Other Number-Theoretic Functions
A recursion formula obtained by differentiating (27.14.18) can be used to calculate Ramanujan’s function τ ( n ) , and the values can be checked by the congruence (27.14.20). …
12: 7 Error Functions, Dawson’s and Fresnel Integrals
Chapter 7 Error Functions, Dawson’s and Fresnel Integrals
13: 20.8 Watson’s Expansions
§20.8 Watson’s Expansions
14: 25.4 Reflection Formulas
25.4.1 ζ ( 1 s ) = 2 ( 2 π ) s cos ( 1 2 π s ) Γ ( s ) ζ ( s ) ,
25.4.2 ζ ( s ) = 2 ( 2 π ) s 1 sin ( 1 2 π s ) Γ ( 1 s ) ζ ( 1 s ) .
25.4.3 ξ ( s ) = ξ ( 1 s ) ,
where ξ ( s ) is Riemann’s ξ -function, defined by:
25.4.4 ξ ( s ) = 1 2 s ( s 1 ) Γ ( 1 2 s ) π s / 2 ζ ( s ) .
15: 27.2 Functions
27.2.11 J k ( n ) = ( ( d 1 , , d k ) , n ) = 1 1 ,
This is Jordan’s function. …
27.2.13 λ ( n ) = { 1 , n = 1 , ( 1 ) a 1 + + a ν ( n ) , n > 1 .
This is Liouville’s function. … This is Mangoldt’s function. …
16: 7.16 Generalized Error Functions
§7.16 Generalized Error Functions
Generalizations of the error function and Dawson’s integral are 0 x e t p d t and 0 x e t p d t . …
17: 27.4 Euler Products and Dirichlet Series
The completely multiplicative function f ( n ) = n s gives the Euler product representation of the Riemann zeta function ζ ( s ) 25.2(i)): … The Riemann zeta function is the prototype of series of the form …The function F ( s ) is a generating function, or more precisely, a Dirichlet generating function, for the coefficients. …
27.4.7 n = 1 λ ( n ) n s = ζ ( 2 s ) ζ ( s ) , s > 1 ,
27.4.12 n = 1 Λ ( n ) n s = ζ ( s ) ζ ( s ) , s > 1 ,
18: 8.1 Special Notation
Alternative notations include: Prym’s functions P z ( a ) = γ ( a , z ) , Q z ( a ) = Γ ( a , z ) , Nielsen (1906a, pp. 25–26), Batchelder (1967, p. 63); ( a , z ) ! = γ ( a + 1 , z ) , [ a , z ] ! = Γ ( a + 1 , z ) , Dingle (1973); B ( a , b , x ) = B x ( a , b ) , I ( a , b , x ) = I x ( a , b ) , Magnus et al. (1966); Si ( a , x ) Si ( 1 a , x ) , Ci ( a , x ) Ci ( 1 a , x ) , Luke (1975).
19: 27.6 Divisor Sums
27.6.1 d | n λ ( d ) = { 1 , n  is a square , 0 , otherwise .
27.6.5 d | n | μ ( d ) | ϕ ( d ) = n ϕ ( n ) ,
27.6.7 d | n μ ( d ) ( n d ) k = J k ( n ) ,
27.6.8 d | n J k ( d ) = n k .
20: 15.15 Sums
15.15.1 𝐅 ( a , b c ; 1 z ) = ( 1 z 0 z ) a s = 0 ( a ) s s ! 𝐅 ( s , b c ; 1 z 0 ) ( 1 z z 0 ) s .