arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.0909math.NT
收藏

A short note on reduced residues

Pascal Stumpf

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑