2 citations · 2 across the 3 of their papers we have counts for
1 paper · 1 filter
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…