About the Project

Ramanujan 1ψ1 summation

AdvancedHelp

(0.002 seconds)

1—10 of 829 matching pages

1: 17.18 Methods of Computation
The two main methods for computing basic hypergeometric functions are: (1) numerical summation of the defining series given in §§17.4(i) and 17.4(ii); (2) modular transformations. Method (1) is applicable within the circles of convergence of the defining series, although it is often cumbersome owing to slowness of convergence and/or severe cancellation. …Lehner (1941) uses Method (2) in connection with the Rogers–Ramanujan identities. Method (1) can sometimes be improved by application of convergence acceleration procedures; see §3.9. …
2: 27.14 Unrestricted Partitions
§27.14(v) Divisibility Properties
Ramanujan (1921) gives identities that imply divisibility properties of the partition function. For example, the Ramanujan identity …
§27.14(vi) Ramanujan’s Tau Function
3: 27.10 Periodic Number-Theoretic Functions
An example is Ramanujan’s sum: …where χ 1 is the principal character (mod k ). … Another generalization of Ramanujan’s sum is the Gauss sum G ( n , χ ) associated with a Dirichlet character χ ( mod k ) . …In particular, G ( n , χ 1 ) = c k ( n ) . … For any Dirichlet character χ ( mod k ) , G ( n , χ ) is separable for n if ( n , k ) = 1 , and is separable for every n if and only if G ( n , χ ) = 0 whenever ( n , k ) > 1 . …
4: 17.8 Special Cases of ψ r r Functions
Ramanujan’s ψ 1 1 Summation
17.8.3 n = ( 1 ) n q n ( 3 n 1 ) / 2 z 3 n ( 1 + z q n ) = ( q , z , q / z ; q ) ( q z 2 , q / z 2 ; q 2 ) .
Bailey’s Bilateral Summations
17.8.6 ψ 4 4 ( q a 1 2 , b , c , d a 1 2 , a q / b , a q / c , a q / d ; q , q a 3 2 b c d ) = ( a q , a q / ( b c ) , a q / ( b d ) , a q / ( c d ) , q a 1 2 / b , q a 1 2 / c , q a 1 2 / d , q , q / a ; q ) ( a q / b , a q / c , a q / d , q / b , q / c , q / d , q a 1 2 , q a 1 2 , q a 3 2 / ( b c d ) ; q ) ,
5: 20.11 Generalizations and Analogs
§20.11(ii) Ramanujan’s Theta Function and q -Series
Ramanujan’s theta function f ( a , b ) is defined by …
§20.11(iii) Ramanujan’s Change of Base
Similar identities can be constructed for F 1 2 ( 1 3 , 2 3 ; 1 ; k 2 ) , F 1 2 ( 1 4 , 3 4 ; 1 ; k 2 ) , and F 1 2 ( 1 6 , 5 6 ; 1 ; k 2 ) . These results are called Ramanujan’s changes of base. …
6: George E. Andrews
Ramanujan, whose last notebook he unearthed in 1976. … Andrews served as President of the AMS from February 1, 2009 to January 31, 2011, and became a Fellow of the AMS in 2012. …
7: 27.20 Methods of Computation: Other Number-Theoretic Functions
To compute a particular value p ( n ) it is better to use the Hardy–Ramanujan–Rademacher series (27.14.9). … 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). …
8: 20.12 Mathematical Applications
For applications of Jacobi’s triple product (20.5.9) to Ramanujan’s τ ( n ) function and Euler’s pentagonal numbers see Hardy and Wright (1979, pp. 132–160) and McKean and Moll (1999, pp. 143–145). … The space of complex tori / ( + τ ) (that is, the set of complex numbers z in which two of these numbers z 1 and z 2 are regarded as equivalent if there exist integers m , n such that z 1 z 2 = m + τ n ) is mapped into the projective space P 3 via the identification z ( θ 1 ( 2 z | τ ) , θ 2 ( 2 z | τ ) , θ 3 ( 2 z | τ ) , θ 4 ( 2 z | τ ) ) . …
9: 27.21 Tables
9 lists all primes that are less than 1 00000. … Tables of the Ramanujan function τ ( n ) are published in Lehmer (1943) and Watson (1949). …
10: Frank Garvan
He is managing editor of the Ramanujan Journal, a journal devoted to areas of mathematics influenced by Ramanujan. …