On partitions classified by smallest missing part

From MaRDI portal
Publication:2422147





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\).











This page was built for publication: On partitions classified by smallest missing part

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2422147)