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

fixed markdown of befunge-92

Browse Source
This commit is contained in:
Mike Schwörer 2019-05-27 23:10:30 +02:00
parent 7a6d6ac877
commit 42dacb8ce6
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
www/statics/euler/Euler_Problem-092_description.md
View File

@ -3,8 +3,10 @@ form a new number until it has been seen before.
For example,
44 ? 32 ? 13 ? 10 ? 1 ? 1
85 ? 89 ? 145 ? 42 ? 20 ? 4 ? 16 ? 37 ? 58 ? 89
~~~
44 -> 32 -> 13 -> 10 -> 1 -> 1
85 -> 89 -> 145 -> 42 -> 20 -> 4 -> 16 -> 37 -> 58 -> 89
~~~
Therefore any chain that arrives at 1 or 89 will become stuck in an endless loop.
What is most amazing is that EVERY starting number will eventually arrive at 1 or 89.