MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / primeCheck

Function primeCheck

project_euler/problem_10/sol2.py:5–8  ·  view source on GitHub ↗
(number)

Source from the content-addressed store, hash-verified

3from itertools import takewhile
4
5def primeCheck(number):
6 if number % 2 == 0 and number > 2:
7 return False
8 return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))
9
10def prime_generator():
11 num = 2

Callers 1

prime_generatorFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected