Question: 
Write a python function to identify non-prime numbers.


Model's Code:
def is_not_prime(n):
    if n < 2:
        return True
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return True
    return False



Sample Correct Code:
import math
def is_not_prime(n):
    result = False
    for i in range(2,int(math.sqrt(n)) + 1):
        if n % i == 0:
            result = True
    return result


Asserts:
assert is_not_prime(2) == False
assert is_not_prime(10) == True
assert is_not_prime(35) == True


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 3 of 974: 2/3 (66.66666666666666%): success