def hasDistinctFactors(number, nFactors): factors = jeffutils.getPrimeFactors(number) uniqueFactors = [] for i in factors: if i not in uniqueFactors: uniqueFactors.append(i) if (uniqueFactors.__len__() == nFactors): return True return False
def hasDistinctFactors(number,nFactors): factors = jeffutils.getPrimeFactors(number); uniqueFactors = []; for i in factors: if i not in uniqueFactors: uniqueFactors.append(i); if(uniqueFactors.__len__() == nFactors): return True; return False;
def getPrimeFactors(number): result = [1]; try: result = primeFactors[number] except KeyError: myFactors = jeffutils.getPrimeFactors(number); primeFactors[number] = myFactors; result = myFactors; return result;
def getPrimeFactors(number): result = [1] try: result = primeFactors[number] except KeyError: myFactors = jeffutils.getPrimeFactors(number) primeFactors[number] = myFactors result = myFactors return result
def phiFunction(number): nPhi = 0 theseFactors = jeffutils.getPrimeFactors(number) for i in range(1, number): myFactors = getPrimeFactors(i) intersection = set(theseFactors).intersection(set(myFactors)) if intersection.__len__() == 0: nPhi += 1 if number / nPhi < nMax: return 0 return nPhi
def phiFunction(number): nPhi = 0 theseFactors = jeffutils.getPrimeFactors(number) for i in range(1, number): myFactors = getPrimeFactors(i); intersection = set(theseFactors).intersection(set(myFactors)); if intersection.__len__() == 0: nPhi+=1; if number/nPhi < nMax: return 0; return nPhi