ddef prime_counter():
    odd = 1
    for i in range(1, 10):       #Sets up main loop
        odd += 2                 #incriments odd by 2 every new i
        for x in range(1, odd):  #sets up loop with current odd value as range limit
            non_zero = (odd % x) #uses current position in range (x) as modulus value
            if non_zero is 0:    #if there is no remainder its not prime
                break            #go to next number in i range
            else:                 #if there is a remainder
                print non_zero    #debug helper
                continue            #go to next number in x range
        else:                     #if prime
            print odd             #print odd
    print 'max prime ' + str(odd)

prime_counter()