Revision as of 23:39, 12 December 2024 edit Bagelfoc (talk \| contribs) 52 edits m →Generating function: Make generating function formula more concise so that it is not displayed awkwardly on smaller screen sizes. Tag: Visual edit ← Previous edit		Revision as of 21:27, 23 December 2024 edit undo 2a00:23c6:5493:4c01:1106:fcc:5188:f299 (talk) →Approximation formulae: Corrected a sp error Tags: Reverted Mobile edit Mobile web edit Next edit →
Line 94: {{harvs\|first=Ken\|last=Ono\|authorlink=Ken Ono\|year=2000\|txt}} proved that there are such congruences for every prime modulus greater than 3. Later, {{harvtxt\|Ahlgren\|Ono\|2001}} showed there are partition congruences modulo every integer [[coprime integers\|coprime]] to 6.{{r\|o2k\|ao}} ==Approximation ~~formulas~~formulae== Approximation ~~formulas~~formulae exist that are faster to calculate than the exact formula given above. An [[asymptotic analysis\|asymptotic]] expression for ''p''(''n'') is given by

Partition function (number theory): Difference between revisions