First numbers

def prime_number(number):
    if number<1:
          return false
    for num in range(1,number):
        if num % num==0 and num % 2 !=0:
            print(num)
    
input_umber=int(input("inter number: "))
print(prime_number(input_umber))

User 943

9

Download Python

aval=True
num=int(input("please enter number: "))
num-=1
while num>1:
    div=num-1
    aval=True
    while div>1:
        if num%div==0:
            aval=False
            break
        div-=1
    if aval:
        print(num)
    num-=1

Saeeda33

S

Download Python

def prime(n):
    my_set = set()
    li = []
    for i in range(2, n):
        if i in my_set:
            continue
        for j in range(i*2, n, i):
            my_set.add(j)
        li.append(i)   
    return li
num = int(input("enter num: "))
print(prime(num))

Marzie.salehi

M

Download Python

a = int(input("add: "))
x = 2 
if a < 2:
    print ("avval nist")
elif a == 2:
    print ("avval ast")
else:
    while (x < (a//2)):
        if (a % x) == 0 :
            print("avval nist")
            break
        x = x + 1
    else:
        print("avval ast" )

Esmaeelphy

E

Download Python

a = int(input("add: "))
j = 2 
if a < 2:
    print ("avval nadarim")
elif a == 2:
    print (a)
else:
    while (j <= a):
        x = 2
        while (x <= (j//2)):
            if (j % x) == 0 :
                j = j + 1
                break
            x = x + 1    
        else:
            print(j)
            j = j + 1

Esmaeelphy

E

Download Python

# Prime Number
Num = int(input("give me a number : "))
PrimeList = [1,2,3]
for i in range(4,Num) :
    Count = 0
    for j in range(2,i):
        Rem = int(i % j)
        if Rem != 0:
            Count += 1
        else:
            break
    if Count == (i-2) :
        PrimeList.append(i)
print(f"The prime number of smaller than {Num} are : {PrimeList}")

User 463

4

Download Python