Problem Archive

We shall define a pythagorean polygon to be a convex polygon with the following properties:

For a given integer $n$, define $P(n)$ as the number of distinct pythagorean polygons for which the perimeter is $\le n$.
Pythagorean polygons should be considered distinct as long as none is a translation of another.

You are given that $P(4) = 1$, $P(30) = 3655$ and $P(60) = 891045$.
Find $P(120)$.

Solution
No solution yet. Write yours at solutions/s292.md.
Problems sourced from Project Euler · Non-commercial & educational use only · CC BY-NC-SA 4.0