[44일차][프로그래머스][12921]소수 찾기

def check_square(number):
    for idx in range(2, int(number**(1/2)+1)):
        if number % idx == 0:
            return False
    
    return True
    
def solution(n):    
    count = 0
    for number in range(2, n+1):
        if check_square(number) == True:
            count += 1
            
    return count