Can someone look at this and tell me if it actually is doing what it's supposed to.
from __future__ import division counter = 1 while True: li =  for i in range(1,(counter+1)): if (counter/i) % 1 == 0: li.append(i) if len(li) <= 2: print counter,"is a prime." counter = counter + 1
It starts from 1 and goes on forever, and for every one of those numbers it divides by every number between 1 and that number. If the resulting number is a whole number it adds it to the list. At the end, it sees if the list only contains two, or less, numbers, if it does, then its a prime number (1 and the number itself should divide).