Python 型ヒント：オリジン 〜Python 3.5で導入された時点の型ヒントって、実は〜

SOLVED: Write a Python function isPrime(number) that determines if the integer argument number is prime or not. The function will return a boolean True or False. Next, write a function HowManyPrimes(P) that takes an integer P as an argument and returns the number of prime numbers whose value is less than P. And then write a function HighestPrime(K) that takes integer K as an argument and returns the highest prime that is less than or equal to K.

Python: Compute the sum of first n given prime numbers - w3resource