This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Primitive Triangles

Problem 276

Published on 29 January 2010 at 09:00 pm [Server Time]

Consider the triangles with integer sides a, b and c with a ≤ b ≤ c.
An integer sided triangle (a,b,c) is called primitive if gcd(a,b,c)=1.
How many primitive integer sided triangles exist with a perimeter not exceeding 10 000 000?


Answer:
Go to back to Problems