Page 1 of 1
(Prime Number) Write a function that gets an int number as the input and returns the total count of prime numbers less t
Posted: Fri Jul 08, 2022 6:45 am
by answerhappygod
- Prime Number Write A Function That Gets An Int Number As The Input And Returns The Total Count Of Prime Numbers Less T 1 (16.83 KiB) Viewed 31 times
(Prime Number) Write a function that gets an int number as the input and returns the total count of prime numbers less than this input. As an example: (If we call this function countPrime) countPrime (18) returns 7 (7 prime numbers less than 18) countPrime(6) returns 3 (3 prime numbers less than 6)