Project Euler – Problem 48

Problem description:

http://projecteuler.net/index.php?section=problems&id=48

---

My solution:

The logic behind:

Simply put: Iterate over all numbers between 1 and 1000. For each iteration n, add nⁿ.
Code uses bcmath functions, as the PHP pow function can’t handle numbers of this scale.

Solution (PHP):

<?php

for ($x = 1; $x < 1000; $x++)
{$sum = bcadd($sum, bcpow($x,$x));}
echo substr($sum,strlen($sum)-10,10);
?>