V Pythonu sice nedělám, ale nešlo by to lépe takto?
for num in range(2, inp+1):
divisor = 2
while divisor < num:
if num % divisor == 0:
break
else:
divisor = divisor + 1
if divisor == num:
primes.append(num)