Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

fix broken links

Browse Source
This commit is contained in:
Mike Schwörer
2018-02-03 18:45:51 +01:00
parent 77a879294a
commit 1ee2563efc
12 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
www/statics/euler/Euler_Problem-044_explanation.md
View File

@@ -4,5 +4,5 @@ The problem is that you need a square root to inverse the pentagonal formula and
So I needed to implement my own version of integer square roots in Befunge (see [wikipedia](https://en.wikipedia.org/wiki/Methods_of_computing_square_roots)).
The program is still not really fast but it's good that I managed to speed it up to a time where you can execute it without waiting the whole night.
Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunGen) has gotten a display of all possible paths a program can take.
Also this program is nicely compact, by the time I'm writing this my Befunge interpreter [BefunExec](https://www.mikescher.de/programs/view/BefunUtils) has gotten a display of all possible paths a program can take.
And if you look at the graph of this program, it looks pretty interesting...

2
www/statics/euler/Euler_Problem-058_explanation.md
View File

@@ -1,4 +1,4 @@
It's obvious that the bottleneck of this program is the primality test.
The numbers become here too big to create a sieve and "normal" prime testing takes too long.
So we use the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](https://http://www.mathblog.dk)).
So we use the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](http://www.mathblog.dk)).
The rest is just enumerating all the diagonals until `primes*10<all`

2
www/statics/euler/Euler_Problem-100_explanation.md
View File

@@ -24,7 +24,7 @@ b = 1/2 ( sqrt(2n^2 - 2n + 1) + 1 )
For the last formula we search for integer solutions.
We can now either solve this manually with diophantine equations,
or we ask [Wolfram|Alpha](www.wolframalpha.com/input/?i=2*b*b-2b+%3D+n*n-n).
or we ask [Wolfram|Alpha](https://www.wolframalpha.com/input/?i=2*b*b-2b+%3D+n*n-n).
Which gives us the following two formulas:
~~~