a naive approach to prime number generation

NaivePrime.py

def naiveprime(n):
    primelist = []
    for num in range(int(n+1)):
        prime= True
        
        for i in range(2,int(num)):
            if (num%i)==0:
                prime=False
                break
        if prime==True: primelist.append(num)
    return primelist[2:]
    
#runtime calculation
import time
tStart=time.time()
naiveprime(6000)
print("Program complete")
print("Time taken:", time.time()-tStart,"seconds")