def findFactors(num: int)->list:
factors=[]
for i in range(1,num+1):
if num%i==0:
factors.append(i)
return factorsdef factors(n):
return set(reduce(list.__add__, \
([i, n//i] for i in range(1, int(n**0.5) + 1) if not n % i )))def factors(x):
listOfFactors = []
for i in range(1, int(x ** 0.5)):
# Use a loop from 1 to the square root of x for more speed.
if x % i == 0:
listOfFactors.append(x)
listOfFactors.append(i)
# May repeat some numbers. Further code would be needed to fix that.
print(i)def find_factors(num: int) -> list:
return [i for i in range(1, num + 1) if num % i == 0]
# print(find_Factors(6))
# [1, 2, 3]