Category Archives: Project Euler

The first Fibonacci Number that is zeroless-pandigital at both ends

Here is another Project Euler problem – this time a little-bit more challenging: “The Fibonacci sequence is defined by the recurrence relation: Fn = Fn1 + Fn2 , where F1 = 1 and F2 = 1. It turns out that … Continue reading

Posted in Project Euler | 8 Comments

Not for XSLT? More Fun with Project Euler

  Here is another Project Euler problem that seems exactly what XSLT was not intended for:   In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to … Continue reading

Posted in Project Euler | Leave a comment

Fun with Project Euler

I have been having fun solving some Project Euler problems. Most of my 76 solutions were done in XSLT 2.0 last year. For those who are busy arguing whether or not  XSLT is a programming language, here is one easy … Continue reading

Posted in Project Euler | Leave a comment