The smallest denominator not contained in a unit fraction decomposition of 1 with fixed length
Abstract
Let v(k) be the smallest integer larger than 1 that does not occur among the denominators in any identity of the form 1=1n1+·s+1nk, where 1 n1<·s<nk are pairwise distinct integers. In their 1980 monograph, Erdős and Graham asked for quantitative estimates on the growth of v(k) and suggested the lower bound v(k) k!. In this paper we give the first known improvement and show that there exists an absolute constant c>0 such that the inequality v(k) ec k2 holds for all positive integers k.
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.