|
|
A037171
|
|
Numbers n such that phi(n) = pi(n), i.e., A000010(n) = A000720(n).
|
|
15
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Leo Moser proved in 1951 that these are the only terms, but he missed the term 10. - Amiram Eldar, May 15 2017
phi(n) >= pi(n) for n >= 61, and phi(n) > pi(n) for n > 90. - Jonathan Sondow, Dec 02 2017
|
|
REFERENCES
|
P. Birch and D. Singmaster, An elementary number theory result, Math. Soc. Newsl., 12 (1984), 10-13.
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 11.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
phi(10)=4, pi(10)=4.
a(1)=2 since k=2 is the lowest index for which A000720(n) = A000010(n), i.e., EulerPhi(n) = PrimePi(n). - M. F. Hasler, Mar 30 2007
|
|
MAPLE
|
select(x->numtheory[phi](x)=numtheory[pi](x), [$1..999]); # M. F. Hasler, Mar 30 2007
|
|
PROG
|
(PARI) for(n=1, 1e5, if(primepi(n)==eulerphi(n), print(n))) /* M. F. Hasler, Mar 30 2007 */
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,fini,full
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|