A short note on reduced residues

Abstract

We solve a problem due to Recamán about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo $n$, as $n\to \infty$.

arXiv commentFor Bernardo Recamán on his 60th birthday; UPDATE: more printer-friendly version, and special thanks to Prof. Jörn Steuding