premier.py

Created by alexandre-merle

Created on October 10, 2023

675 Bytes

from math import *
print("Exemple:")
print("prem(17)")
def prem(i):
  divisor=[1]
  ok=0
  if i%2==1:
    for j in range(3,(i/2)+0.5):
      if i%j==0:
        ok+=1
        divisor+=[j]
  else:
    ok+=1
    divisor+=[2]
    for j in range(3,i/2):
      if i%j==0:
        divisor+=[j]
    divisor+=[int(i/2)]

  if ok==0:
    print(str(i)+" est un nombre premier.")
    return False
  else:
    print(str(i)+" n'est pas un nombre premier.")
    print("diviseur:")
    n=0
    for b in divisor:
      print("=>"+str(b))
      n+=b
    if n==i:
      print(str(i)+" est un nombre parfait.")
    print("La somme de ses diviseur est "+str(n)+".")
    return True

During your visit to our site, NumWorks needs to install "cookies" or use other technologies to collect data about you in order to:

With the exception of Cookies essential to the operation of the site, NumWorks leaves you the choice: you can accept Cookies for audience measurement by clicking on the "Accept and continue" button, or refuse these Cookies by clicking on the "Continue without accepting" button or by continuing your browsing. You can update your choice at any time by clicking on the link "Manage my cookies" at the bottom of the page. For more information, please consult our cookies policy.

Accept and continue Continue without accepting