[alexr1090]

Hi D.I.C. heads. I'm attempting to do some of the Project Euler problems. Right now I'm having trouble with problem 21 and I was hoping I could receive some help for it. I'm not necessarily looking for code, just a point in the right direction. Oh yeah and basically I know this is wrong because I looked up the answer. The correct answer is supposed to be

Spoiler

31626

def getProperDivisors(x):
	ams = []
	for y in range(1,x):
		if x%y == 0: ams.append(y)
	return ams
def addProperDivisors(ams):
	total = 0
	for x in ams:
		total +=x
	return total 
total = 0
dictionary = {}
for x in range(2,10001):
	if x in dictionary: 
		if dictionary[x] < x:
			continue
		else:
			b = addProperDivisors(getProperDivisors(dictionary[x]))
			if b == dictionary[x]:
				total += dictionary[x]+ b
				continue
	a = addProperDivisors(getProperDivisors(x))
	dictionary[x] = a
	b = addProperDivisors(getProperDivisors(a))
	dictionary[a] = b
	if a == b:
		total += a+b
		
print total

[sepp2k]

The condition for an amicable pair is that "d(a) = b and d(b) = a, where a ≠ b". Your if condition if a == b does not express that.

This post has been edited by sepp2k: 28 August 2012 - 11:07 PM

[alexr1090]

Hey thanks a lot man. That helped me solve it