A short note on reduced residues

Abstract

We solve a problem due to Recam\'an 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$.