Bijecting Euler's Partitions-Recurrence (Q3695324)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3918451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bijecting Euler's Partitions-Recurrence |
scientific article; zbMATH DE number 3918451 |
Statements
Bijecting Euler's Partitions-Recurrence (English)
0 references
1985
0 references
number of partitions
0 references
bijection
0 references
0.8317329287528992
0 references
0.8141055107116699
0 references
0.8090454936027527
0 references
0.8058357834815979
0 references
0.79942387342453
0 references
Euler used generating functions to prove that if p(n) denotes the number of partitions of n and if \(a(m)=(3m^ 2+m)/2\), then \(\sum_{m even}p(n- a(m))=\sum_{m odd}p(n-a(m)).\) This paper exhibits an explicit bijection between partitions of n-a(m) with m even and partitions of n-a(m) with m odd.
0 references