A short note on reduced residues
classification
🧮 math.NT
keywords
reducedarithmeticbehaviorboundinftyleastlengthlower
read the original 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$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.