Partitions and the Minimal Excludant

George E. Andrews, David Newman

Research output: Contribution to journalArticlepeer-review

28 Scopus citations


Fraenkel and Peled have defined the minimal excludant or “mex” function on a set S of positive integers is the least positive integer not in S. For each integer partition π, we define mex(π) to be the least positive integer that is not a part of π. Define σmex(n) to be the sum of mex(π) taken over all partitions of n. It will be shown that σmex(n) is equal to the number of partitions of n into distinct parts with two colors. Finally the number of partitions π of n with mex(π) odd is almost always even.

Original languageEnglish (US)
Pages (from-to)249-254
Number of pages6
JournalAnnals of Combinatorics
Issue number2
StatePublished - Jun 1 2019

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Partitions and the Minimal Excludant'. Together they form a unique fingerprint.

Cite this