python - Getting values from all the indices of a list (Determining Prime Numbers) -

first , foremost i'm new python. trying determine if number, let's 167 prime number using modulo operation, %.

e.g., let 167 % n = value i

when 167 % 1 , 167 % 167, should return 0 , n in range(2,166), should giving remainder of 167 % n. problem have trying print remainder when 167 % n n = 1 ~ 167 don't know how values (which should remainder) of indices of list.

so, here's have:

l  = [] #creates empty list i=0     #initialize i?  in range(1, 168) : if 167 % == 0  :     print ("there no remainder") else :     167 % == x   # x should value of remainder      l[i].append(x) #attempting add x ... indices of list.      print(l[x])    #print values of x. 

it's better if can use while loop, should clearer. so, while i iterates 1-167, should adding results x indices of list , want print results.

any recommendation guys? appreciated!! bunch.

this creates list of remainders not equal zero:

l  = [] in range(1, 168) :     remainder = 167 %     if remainder == 0  :         print("there no remainder")     else:         l.append(remainder)         print(remainder)  >>> len(l) 165 

there number of problems in code:

• your indentation wrong.
• setting i = 0 before loop not make sense because not used before loop , overridden in loop.
• this: 167 % == x compares remainder non-existing x. want assign result x x = 167 % i.
• you try append element of l @ index i using l[i].append(x) want append x l l.append(x).
• finally, try value added using print(l[x]) need use print(l[i]), simpler, print remainder print(remainder).