PROJECT EULER #12

Link to page

The sequence of triangle numbers is generated by adding the natural numbers. So the 7^th 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?

using System;

namespace ProjectEuler
{
   class Program
   {
       static void Main(string[] args)
       {
           //Problem 12
           DateTime start = DateTime.Now;
     
           long triangleNumber=0, numberOfFactors=0,i=1;
           while (numberOfFactors<500)
           {
               numberOfFactors = 0;
               triangleNumber += i;
               for (long j = 1; j <= Math.Sqrt(triangleNumber); j++)
               {
                   numberOfFactors += triangleNumber%j == 0 ? 2 : 0;
               }
               i++;
           }
           Console.WriteLine("{0} has {1} factors",triangleNumber,numberOfFactors);

           TimeSpan time = DateTime.Now-start;
           Console.WriteLine("This took {0}", time);
           Console.ReadKey();
       }
   }
}