ok so I'm trying to make a function that when u enter an integer, it'll return all prime numbers under it using the eratosthene.
few questions: why prime_num = [True] * n needs to be timed with n? I'm assuming that'll mean you'll be printing as many trues in a list as the number of the input
and for the line for i in range (j*j,n,j):, why is it not possible to change the upper bound to be n+1, I'm trying to ake the function inclusive of the input, not exclusive