This repository contains my solutions to Project Euler problems.

Zelphir Kaltstahl 961f670120 add solution for puzzle 019 %!s(int64=2) %!d(string=hai) anos
.gitignore 6b5a4d464c add gitignore file %!s(int64=2) %!d(string=hai) anos
001.scm 3298eda023 add the first 2 solutions %!s(int64=3) %!d(string=hai) anos
002.scm afff51a6e9 reformat comments %!s(int64=3) %!d(string=hai) anos
003.scm 83e997df6d reset the call %!s(int64=3) %!d(string=hai) anos
004.scm d588efe634 ad solution for problem 4 %!s(int64=3) %!d(string=hai) anos
005.scm 7c83d8e1bd add solution to problem 5 %!s(int64=3) %!d(string=hai) anos
006.scm 8db87b06d2 prepare 006 %!s(int64=3) %!d(string=hai) anos
007.scm f0a03b88ff add solution %!s(int64=2) %!d(string=hai) anos
008.scm 4a4ede5f2d add solution for problem 8 %!s(int64=2) %!d(string=hai) anos
009.scm 3d5d2d79df add another solution %!s(int64=2) %!d(string=hai) anos
010.scm a438779009 remove logs and comments %!s(int64=2) %!d(string=hai) anos
011.scm 0cef597b1c add solution for problem 11 %!s(int64=2) %!d(string=hai) anos
012.scm 36fc020de6 add solution for 012 %!s(int64=2) %!d(string=hai) anos
013-input.txt a76587c43a add solution to puzzle 013 %!s(int64=2) %!d(string=hai) anos
013.scm a76587c43a add solution to puzzle 013 %!s(int64=2) %!d(string=hai) anos
014-improved.scm 292a39786d move display call inside %!s(int64=2) %!d(string=hai) anos
014.scm 15be831e29 add solution to 014 %!s(int64=2) %!d(string=hai) anos
015.scm 6f2b65f4dd remove unnecessary imports %!s(int64=2) %!d(string=hai) anos
016.scm bb7d27c2a5 add puzzle 016 solution %!s(int64=2) %!d(string=hai) anos
017.scm df1c616824 add solution for problem 017 %!s(int64=2) %!d(string=hai) anos
018-bottom-up-approach.scm a54d3958fd finally solved the puzzle using a bottom-up algorithm %!s(int64=2) %!d(string=hai) anos
018-input.txt abbd696695 add solution for 018 %!s(int64=2) %!d(string=hai) anos
018.scm 758ceef3f4 outsource bottom up approach and use records %!s(int64=2) %!d(string=hai) anos
019.scm 961f670120 add solution for puzzle 019 %!s(int64=2) %!d(string=hai) anos
LICENSE aa0f470465 Initial commit %!s(int64=3) %!d(string=hai) anos
debug-utils.scm 961f670120 add solution for puzzle 019 %!s(int64=2) %!d(string=hai) anos
fileio.scm eb4bada90d move definitions into library expression %!s(int64=2) %!d(string=hai) anos
function-combinators.scm a1d2b19468 add more useful modules %!s(int64=2) %!d(string=hai) anos
list-helpers.scm 43b6dfb6b3 implemented bottom up %!s(int64=2) %!d(string=hai) anos
math.scm 9151c2257f add digits sum %!s(int64=2) %!d(string=hai) anos
naive-prime-test.scm bc73cb869e fix r6rs library usage %!s(int64=2) %!d(string=hai) anos
parallelism.scm 97b67d96c9 outsource parallelism %!s(int64=2) %!d(string=hai) anos
rabin-miller-test.scm bc73cb869e fix r6rs library usage %!s(int64=2) %!d(string=hai) anos
readme.md e077f54037 update readme %!s(int64=2) %!d(string=hai) anos
readme.org e077f54037 update readme %!s(int64=2) %!d(string=hai) anos
segment.scm cb6585a490 reformat %!s(int64=2) %!d(string=hai) anos

readme.md

About

This project contains code for solving the problems of Project Euler.

Solutions

You can compare solutions for example with https://github.com/luckytoilet/projecteuler-solutions/blob/master/Solutions.md.

I have no proof, that those solutions are correct. To me it seems, that the chances, that they are correct increases, if they match my results. If they do not match my results, I check my code again. It has happened, that I then found bugs in my code and after fixing them arrived at the same solution as given in that repository. Ultimately, there is no proof though.

License

The code itself is licensed as AGPLv3. The problem descriptions are licensed, as required by the Project Euler license, as CC BY-NC-SA 4.0. For more detail see https://projecteuler.net/copyright.