No CrossRef data available.
Published online by Cambridge University Press: 20 November 2018
If ϕ(n) denotes the Euler function, for n = p a prime we have ϕ(n)/n = (1-1/p), which implies that
In this note we consider a refinement of this result. Namely, we prove that
1
where P∗(k) is the largest integer of the form where p1 < p2<…<pr are the first r primes in ascending order.