Пример #1
0
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
Пример #2
0
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;
Пример #3
0
def getPrimeFactors(number):
	result = [1];

	try:
	  result = primeFactors[number]
	except KeyError:
		myFactors = jeffutils.getPrimeFactors(number);
	 	primeFactors[number] = myFactors;
	 	result = myFactors;

	return result;
Пример #4
0
def getPrimeFactors(number):
    result = [1]

    try:
        result = primeFactors[number]
    except KeyError:
        myFactors = jeffutils.getPrimeFactors(number)
        primeFactors[number] = myFactors
        result = myFactors

    return result
Пример #5
0
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
Пример #6
0
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