I am trying to count the number of prime numbers which end by digit "$3$" such as $3, 13, 23$, etc. and are below $10^6$.
The number of primes existing below $10^6$ is known empirically to be $78~ 498$. Because, at most 1 every 10 numbers ends by the digit 3, it means that, at most there could be $7850$. So this is the lowest bound I have found so far.
Is this lower bound correct?
I thought so, but when trying to answer in a questionnaire, it is said my result is wrong:

What is the problem?