How many prime numbers are there from 43 to 60

divisor-counting-functionprime numbers

The question doesn't mention anything about 'inclusive' or 'exclusive'. If I include 43 in my count, there are 4 prime numbers between 43 and 60. If I exclude 43, there are 3 prime numbers. What is the most appropriate way to approach this kind of math problem?

Best Answer

Define ''the amount of primes numbers below $n$'' as $\pi(n)$, the prime-counting function. Then the question ''How many prime numbers are there from 43 to 60?'' can be ''translated'' as $$ \pi(60) - \pi(43), $$ which is equal to $3$.