The prime counting function, denoted by counts the number of primes less or equal to .
Consider the process of continually finding the value of of until it equals zero.
For example,for we have
From the above we can say that has a pi chain of length 8 and has a pi chain of length 5 .
How many integers have a pi chain of length 9 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
let f ( n ) denote the prime at position n.
so we have f ( 1 ) = 2 , f ( 2 ) = 3 . f ( 3 ) = 5 . . .
Now we have:
f ( 1 ) = 2
f ( 2 ) = 3
f ( 3 ) = 5
f ( 5 ) = 1 1
f ( 1 1 ) = 3 1
f ( 3 1 ) = 1 2 7
f ( 1 2 7 ) = 7 0 9
f ( 7 0 9 ) = 5 3 8 1
f ( 5 3 8 1 ) = 5 2 7 1 1
the answer is 5 2 7 1 1 − 5 3 8 1 = 4 7 3 3 0