Hobby project using Common Lisp to solve numeric puzzles as those proposed by Project Euler.
This is a personal, exploratory project with no fixed roadmap. Its aim is essentially to improve my skills. Development happens irregularly as time permits.
When relevant, an optimized solution, compiling with no note under (speed 3) is proposed.
A test suite is proposed.
Table of contents:
Any comment? Open an issue, or start a discussion here or at profile level.
Project Euler problems solved are: 1, 2 3, 4, 5, 6, 9.
Tupper's self-referential formula is a formula that visually represents itself when graphed on plane.
See Wikipedia or Wolfram MathWorld.
Formula:
SBCL supports 'big' integers, which allows implementing the formula directly:
Output:
I have added this code to Rosetta Code.
(end of README)