A Refinement of the Crank-Mex Theorem
Abstract
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.