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

ParsedownCustom

Browse Source
This commit is contained in:
Mike Schwörer
2018-01-01 23:03:05 +01:00
parent 32f1e8437b
commit e56ca264a3
36 changed files with 939 additions and 277 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
www/statics/euler/Euler_Problem-091_description.md
View File

@@ -1,7 +1,7 @@
The points `P(x1, y1)` and `Q(x2, y2)` are plotted at integer co-ordinates and are joined to the origin,
`O(0,0)`, to form `OPQ`.
![img](/data/blog/Befunge/p091_1.gif)
![img](/data/images/blog/p091_1.gif)
There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate
lies between 0 and 2 inclusive; that is,
@@ -10,6 +10,6 @@ lies between 0 and 2 inclusive; that is,
0 <= x1, y1, x2, y2 <= 2.
~~~
![img](/data/blog/Befunge/p091_2.gif)
![img](/data/images/blog/p091_2.gif)
Given that `0 <= x1, y1, x2, y2 <= 50`, how many right triangles can be formed?