################################################################################################################
#                                   Project Euler Problem 12
#
# The sequence of triangle numbers is generated by adding the natural numbers.
# So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
#
# 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...
#
# Let us list the factors of the first seven triangle numbers:
#
# 1: 1
# 3: 1,3
# 6: 1,2,3,6
# 10: 1,2,5,10
# 15: 1,3,5,15
# 21: 1,3,7,21
# 28: 1,2,4,7,14,28
# We can see that 28 is the first triangle number to have over five divisors.
#
# What is the value of the first triangle number to have over five hundred divisors?
################################################################################################################


def testFactors(number):
    factorList = []
    for x in range (1, number/2 + 1):
        if number % x == 0:
            factorList.append(x)
    if len(factorList) > 500:
        return True, number
    else:
        return False

def generateTriangleNumbers(number):
    '''  uses a for loop and an accumulator variable to generate triangle numbers '''
    triangleNumber = 0
    for x in range(1, number + 1):
        triangleNumber += x
    return triangleNumber

def getAnswer():
    counter = 1
    triangleNumber = generateTriangleNumbers(counter)
    while testFactors(triangleNumber) != True:
        counter += 1
    return testFactors(triangleNumber)



        
