PE-CN / pe-cn-comments

2 stars 0 forks source link

Problem 827 | Project Euler | #829

Open sx349 opened 1 year ago

sx349 commented 1 year ago

https://pe-cn.github.io/827/

Problem 827 Pythagorean Triple OccurrenceDefine $Q(n)$ to be the smallest number that occurs in exactly $n$ Pythagorean triples $(a,b,c)$ where $a \lt b \lt c$. For example, $15$ is the smallest numb