Project Euler: problem 1 (PHP) – Multiples of 3 and 5

I previously blogged about this Project Euler puzzle 6 years ago, using ColdFusion.  This is my approach using PHP as a simple practical exercise for myself, and I’d appreciate any feedback on my PHP code.

Problem 1:

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

So not too tricky to start with:

<?php 
$sum = 0;

for ($i = 1; $i < 1000; $i++) {
	if ($i % 3 == 0 || $i % 5 == 0) {
		$sum += $i;
	}
}

echo $sum;
?>

The only thing I really noticed was that I could have used fmod(x, y) instead of x % y == 0 to calculate the modulus values, although I didn’t see any benefit in doing so at this point, with such small integers.  However it wasn’t long before I had to do so (in the third Project Euler puzzle).