Is there an equation for finding divisors (or number of divisors) of a number? I'm playing around with Project Euler and I'm stuck with this: http://projecteuler.net/problem=12 problem. My algorithm calculates number of divisors way to long (I'm simply checking if modulo equals 0 for every possible number)

Question

anonymous · Answer

http://en.wikipedia.org/wiki/Divisor_function

anonymous · Answer

How could I not see that? Thanks ;)

anonymous · Answer

ur welcome

amistre64 · Answer

couldnt that be worked out using relative primes?  gcd = 1 ?