Metraipolis › archive › dc_74611d4e9178

Partition function (number theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Partition_function_(number_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T14:34:10.524Z
SHA-256 of the archived text
51cca9eec2ad4efd26e16f8fff37974559df366593247a7155c19c738ea1c909
Stable URL of this page
https://metraipolis.com/documento/dc_74611d4e9178

How to cite

Partition function (number theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Partition_function_(number_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_74611d4e9178 (Metraipolis archive dc_74611d4e9178, sha256 51cca9eec2ad4efd26e16f8fff37974559df366593247a7155c19c738ea1c909)
BibTeX
@misc{dc74611d4e9178,
  title = {Partition function (number theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Partition_function_(number_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_74611d4e9178; sha256 51cca9eec2ad4efd26e16f8fff37974559df366593247a7155c19c738ea1c909},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Partition_function_(number_theory). Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In number theory, the partition function p(n) represents the number of possible partitions of a non-negative integer n. 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. It grows as an exponential function of the square root of its argument. The multiplicative inverse of its generating function is the Euler function; by Euler's pentagonal number theorem, this function is an alternating sum of pentagonal number powers of its argument. Srinivasa Ramanujan first discovered that the partition function has nontrivial patterns in modular arithmetic, now known as Ramanujan's congruences. For instance, whenever the decimal representation of n ends in the digit 4 or 9, the number of partitions of n will be divisible by 5.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «number theory»).
Fonte: Wikipedia in inglese, voce «Partition function (number theory)» — https://en.wikipedia.org/wiki/Partition_function_(number_theory)
Wikidata Q15846551 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q15846551
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Partition_function_(number_theory)?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1371388914, consultata il 2026-10-15T13:57:01.564Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e9b46ad1a76a664d2d2a65fd919ca9b724718343c8fea7b39db6f191a7fb4f6d