Pascal Stumpf
Published 2014-08-05, updated 2014-08-06Version 2
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$.
Comments: For Bernardo Recam\'an on his 60th birthday; UPDATE: more printer-friendly version, and special thanks to Prof. J\"orn Steuding
Valuations, arithmetic progressions, and prime numbers
Bounding sums of the Möbius function over arithmetic progressions
Explicit bounds for primes in arithmetic progressions
![QR code for arXiv:1408.0909 [math.NT]](http://oss.arxitics.com/images/favicon.svg)