On partitions classified by smallest missing part (Q2422147)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On partitions classified by smallest missing part |
scientific article; zbMATH DE number 7067772
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On partitions classified by smallest missing part |
scientific article; zbMATH DE number 7067772 |
Statements
On partitions classified by smallest missing part (English)
0 references
18 June 2019
0 references
In this paper, the author investigates the following inequality related to the parity of the smallest missing part of partitions: the number of partitions of \(n\) in which the smallest missing part is odd is always larger than or equal to the number of partitions of \(n\) in which the smallest missing part is even except the case when \(n=1\).
0 references
partitions
0 references
combinatorics
0 references
0 references
0.7749424576759338
0 references
0.7314522862434387
0 references
0.730695366859436
0 references
0.7232389450073242
0 references
0.7214033603668213
0 references
