Project Euler Forum

hk wrote: Sat May 13, 2017 12:55 pm If you're still stuck with this problem you might look at :number of divisors or number of divisors

I'm trying to solve this problem. Initially I figured out a brute force algorithm would'nt work then I saw this method for calculating the numbers of divisors. Howewer even that gets slower after 300. I thought about calculating the divisors of a number and its subsequent (since a triangular number = n*(n+1)/2 ) and try to workout a formula to get the divisors a triangular number from that, or try to work out a lower bound for numbers that have at least 500 factors.