Search results
Results from the WOW.Com Content Network
In mathematics, the Ramanujan conjecture, due to Srinivasa Ramanujan (1916, p. 176), states that Ramanujan's tau function given by the Fourier coefficients τ(n) of the cusp form Δ(z) of weight 12 Δ ( z ) = ∑ n > 0 τ ( n ) q n = q ∏ n > 0 ( 1 − q n ) 24 = q − 24 q 2 + 252 q 3 − 1472 q 4 + 4830 q 5 − ⋯ , {\displaystyle \Delta (z ...
As evidence, many provided Ramanujan's τ(p) (case of weight 12). The only solutions up to 10 10 to the equation τ(p) ≡ 0 (mod p) are 2, 3, 5, 7, 2411, and 7 758 337 633 (sequence A007659 in the OEIS). [11] Lehmer (1947) conjectured that τ(n) ≠ 0 for all n, an assertion sometimes known as Lehmer's
Let n be a non-negative integer and let p(n) denote the number of partitions of n (p(0) is defined to be 1).Srinivasa Ramanujan in a paper [3] published in 1918 stated and proved the following congruences for the partition function p(n), since known as Ramanujan congruences.
Extending the results of A. Atkin, Ken Ono in 2000 proved that there are such Ramanujan congruences modulo every integer coprime to 6. For example, his results give For example, his results give p ( 107 4 ⋅ 31 k + 30064597 ) ≡ 0 ( mod 31 ) . {\displaystyle p(107^{4}\cdot 31k+30064597)\equiv 0{\pmod {31}}.}
The Erdős–Turán conjecture on additive bases of natural numbers. A conjecture on quickly growing integer sequences with rational reciprocal series. A conjecture with Norman Oler [2] on circle packing in an equilateral triangle with a number of circles one less than a triangular number. The minimum overlap problem to estimate the limit of M(n).
See Winnie Li's survey on Ramanujan's conjecture and other aspects of number theory relevant to these results. [ 5 ] Lubotzky , Phillips and Sarnak [ 2 ] and independently Margulis [ 6 ] showed how to construct an infinite family of ( p + 1 ) {\displaystyle (p+1)} -regular Ramanujan graphs, whenever p {\displaystyle p} is a prime number and p ...
For instance, p(4) = 5 because the integer 4 has the five partitions 1 + 1 + 1 + 1, 1 + 1 + 2, 1 + 3, 2 + 2, and 4. No closed-form expression for the partition function is known, but it has both asymptotic expansions that accurately approximate it and recurrence relations by which it can be calculated exactly.
The initial idea is usually attributed to the work of Hardy with Srinivasa Ramanujan a few years earlier, in 1916 and 1917, on the asymptotics of the partition function.It was taken up by many other researchers, including Harold Davenport and I. M. Vinogradov, who modified the formulation slightly (moving from complex analysis to exponential sums), without changing the broad lines.