Published online by Cambridge University Press: 20 November 2018
As usual we denote the number of integers not exceeding n and relatively prime to n by Euler's ϕ function ϕ(n). Lehmer calls the ϕ(n) integers
the totatives of n.
Denote by ϕ(k,l,n) the number of a's satisfying
If nl ≡ 0 (mod k) or n(l + 1) ≡ 0 (mod k) then, since n > k, (n - l/k, n) > 1 and (n(l + 1)/k, n)>1 respectively. Thus ϕ(k, l, n) is the number of totatives of n satisfying
1. Amer. Math. Monthly, 64 (1957), 585-586.
2. Canad. J. of Math. 7(1955), 347-357.