Project Euler: Problem 1 (Possible refactorings and run time optimizations)

Question

I have been hearing a lot about Project Euler so I thought I solve one of the problems in C#. The problem as stated on the website is as follows:

If w

Answer 1

The code in DivisibleByThreeOrFive would be slightly faster if you would state it as follows:

return ((counter % 3 == 0) || (counter % 5 == 0));

And if you do not want to rely on the compiler to inline the function call, you could do this yourself by putting this code into the Main routine.