Function isprime

project_euler/problem_03/sol1.py:10–19

(no)

import math

def isprime(no):
    if(no==2):
        return True
    elif (no%2==0):
        return False
    sq = int(math.sqrt(no))+1
    for i in range(3,sq,2):
        if(no%i==0):
            return False
    return True

maxNumber = 0
n=int(input())