diviseurs.py

Created by alex-juge84

Created on October 10, 2021

370 Bytes


from math import *

#Utilisation boucle for
def div1(n):
  diviseurs = []
  for i in range(1, sqrt(n)):
    if n % i == 0:
      diviseurs.append((i, n//i))
  return diviseurs
      
#Utilisation boucle while
def div2(n):
  diviseurs = []
  i = 1
  while i <= sqrt(n):
    if n % i == 0:
      diviseurs.append((i, n//i))
    i += 1
  return diviseurs