About the Project

Chu–Vandermonde identity

AdvancedHelp

(0.001 seconds)

31—40 of 144 matching pages

31: 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 …implies p ( 5 n + 4 ) 0 ( mod 5 ) . …For example, p ( 1575 25693 n + 1 11247 ) 0 ( mod 13 ) . …
32: 26.3 Lattice Paths: Binomial Coefficients
§26.3(iv) Identities
33: 27.19 Methods of Computation: Factorization
Type II probabilistic algorithms for factoring n rely on finding a pseudo-random pair of integers ( x , y ) that satisfy x 2 y 2 ( mod n ) . …
34: 20.7 Identities
§20.7 Identities
Also, in further development along the lines of the notations of Neville (§20.1) and of Glaisher (§22.2), the identities (20.7.6)–(20.7.9) have been recast in a more symmetric manner with respect to suffices 2 , 3 , 4 . …
§20.7(v) Watson’s Identities
20.7.15 A A ( τ ) = 1 / θ 4 ( 0 | 2 τ ) ,
This reference also gives the eleven additional identities for the permutations of the four theta functions. …
35: 24.19 Methods of Computation
Another method is based on the identitiesFor number-theoretic applications it is important to compute B 2 n ( mod p ) for 2 n p 3 ; in particular to find the irregular pairs ( 2 n , p ) for which B 2 n 0 ( mod p ) . …
36: 25.9 Asymptotic Approximations
25.9.2 χ ( s ) π s 1 2 Γ ( 1 2 1 2 s ) / Γ ( 1 2 s ) .
37: 25.13 Periodic Zeta Function
25.13.1 F ( x , s ) n = 1 e 2 π i n x n s ,
38: 26.6 Other Lattice Path Numbers
§26.6(iv) Identities
26.6.12 C ( n ) = k = 1 n N ( n , k ) ,
39: 26.10 Integer Partitions: Other Restrictions
The set { n 1 | n ± j ( mod k ) } is denoted by A j , k . …
§26.10(iv) Identities
Equations (26.10.13) and (26.10.14) are the Rogers–Ramanujan identities. …
40: 16.19 Identities
§16.19 Identities
This reference and Mathai (1993, §§2.2 and 2.4) also supply additional identities.