Search results
Results from the WOW.Com Content Network
The more general Ramanujan–Petersson conjecture for holomorphic cusp forms in the theory of elliptic modular forms for congruence subgroups has a similar formulation, with exponent (k − 1)/2 where k is the weight of the form.
The Rogers–Ramanujan identities appeared in Baxter's solution of the hard hexagon model in statistical mechanics. The demodularized standard form of the Ramanujan's continued fraction unanchored from the modular form is as follows::
In mathematics, a mock modular form is the holomorphic part of a harmonic weak Maass form, and a mock theta function is essentially a mock modular form of weight 1 / 2 . The first examples of mock theta functions were described by Srinivasa Ramanujan in his last 1920 letter to G. H. Hardy and in his lost notebook .
The web of modularity: arithmetic of the coefficients of modular forms and q-series. CBMS Regional Conference Series in Mathematics. Vol. 102. Providence, RI: American Mathematical Society. ISBN 978-0-8218-3368-1. Zbl 1119.11026. Ramanujan, S. (1919). "Some properties of p(n), the number of partitions of n".
In mathematics, a Ramanujan–Sato series [1] [2] generalizes Ramanujan’s pi formulas such as, = = ()!! + to the form = = + by using other well-defined sequences of integers obeying a certain recurrence relation, sequences which may be expressed in terms of binomial coefficients (), and ,, employing modular forms of higher levels.
Srinivasa Ramanujan is credited with discovering that the partition function has nontrivial patterns in modular arithmetic. For instance the number of partitions is divisible by five whenever the decimal representation of n {\displaystyle n} ends in the digit 4 or 9, as expressed by the congruence [ 7 ] p ( 5 k + 4 ) ≡ 0 ( mod 5 ...
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Ramanujan tau function, giving the Fourier coefficients of the Ramanujan modular form Divisor function , an arithmetic function giving the number of divisors of an integer Topics referred to by the same term