English

A short note on reduced residues

Number Theory 2014-08-07 v2

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 nn, as nn \to \infty.

Keywords

Cite

@article{arxiv.1408.0909,
  title  = {A short note on reduced residues},
  author = {Pascal Stumpf},
  journal= {arXiv preprint arXiv:1408.0909},
  year   = {2014}
}

Comments

For Bernardo Recam\'an on his 60th birthday; UPDATE: more printer-friendly version, and special thanks to Prof. J\"orn Steuding

R2 v1 2026-06-22T05:20:33.628Z