can you build or generate at least 5 pythagorean triples using one of many formulas? and can u verify each one of them in the pythagorean theorem equation

Answer 1

given any integers m > n,

a = m^2 - n^2
b = 2mn
c = m^2 + n^2

a,b,c form a Pythagorean triple

for (m,n) = (2,1) we get (3,4,5)
for (m,n) = (3,2) we get (5,12,13)
and so on

Answer 2

thanks