OFFSET
1,2
COMMENTS
Also, numbers k such that PrimePi(k) = PrimePi(sqrt(k)) + k * Product_{p prime <= sqrt(k)} (1 - 1/p) - 1.
LINKS
Solomon W. Golomb, Some Problems About Primes, Golomb's Puzzle Column, IEEE Information Theory Society Newsletter, Vol. 58, No. 3 (September 2008), p. 4. See Problems 5 and 6; Some Problems About Primes Solutions, ibid., Vol. 58, No. 4 (December 2008), p. 47.
MATHEMATICA
q[k_] := IntegerQ[k * Product[1 - 1/p, {p, Select[Range[Sqrt[k]], PrimeQ]}]]; Select[Range[200], q]
PROG
(PARI) isok(k) = {my(r = k); forprime(p = 1, sqrtint(k), r *= (1 - 1/p)); denominator(r) == 1; }
CROSSREFS
KEYWORD
nonn,easy,fini,full
AUTHOR
Amiram Eldar, Aug 08 2025
STATUS
approved
