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

rename statics/euler and sync b93 code with main repo

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 17:38:54 +01:00
parent 0efeb3afeb
commit 69e3f51730
409 changed files with 745 additions and 509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
www/statics/euler/Euler_Problem-086_description.md Normal file
View File

@@ -0,0 +1,17 @@
A spider, **S**, sits in one corner of a cuboid room, measuring `6 by 5 by 3`,
and a fly, **F**, sits in the opposite corner.
By travelling on the surfaces of the room the shortest "straight line"
distance from **S** to **F** is 10 and the path is shown on the diagram.
![img](/data/blog/Befunge/p086.gif)
However, there are up to three "shortest" path candidates for any given cuboid and
the shortest route doesn't always have integer length.
It can be shown that there are exactly `2060` distinct cuboids, ignoring rotations,
with integer dimensions, up to a maximum size of `M by M by M`,
for which the shortest route has integer length when `M = 100`.
This is the least value of M for which the number of solutions first exceeds two thousand;
the number of solutions when `M = 99` is `1975`.
Find the least value of M such that the number of solutions first exceeds one million.