Example #1
0
def triangleNum():
    #get triangle number, check number of factors, move on
    triNum = 1
    count = 2
    length = len(sup.factor(triNum))
    while(length <= 500):
        triNum += count
        length = len(sup.factor(triNum))
        count += 1
    print triNum
Example #2
0
def isAmicable(n):
	nFactors = sup.factor(n)
	nFactors.sort()
	nFactors = nFactors[:-1]
	nSum = sumArr(nFactors)

	nFactors = sup.factor(nSum)
	nFactors.sort()
	nFactors = nFactors[:-1]
	mSum = sumArr(nFactors)

	if(mSum == n):
		if(nSum == n):
			return False
		return True
	return False
Example #3
0
def abundantNum(n):
	fac = sup.factor(n)
	fac.sort()
	fac = fac[:-1]	# removes n as a factor of itself

	total = 0
	for num in fac:
		total += num

	if (total > n):
		return True
	return False