elisp-problem-solving

This project uses Emacs 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.

Solutions are proposed in Emacs Lisp using cl-lib, and also in "traditional" Emacs Lisp without cl-lib.

A test suite is proposed in z_tests.el file (instructions inside).

Table of contents:

• Project Euler
• Tupper formula

Any comment? Open an issue, or start a discussion here or at profile level.

Project Euler

Project Euler problems solved are: 1, 2, 3, 4, 5, 6, 7, 9, 10.

Tupper formula

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)