Talk:Special pythagorean triplet

For those paying "attention to timings" and more importantly for those paying attention to other comments I have made on these Euler tasks about filling RC with solutions worse than I would expect from a schoolboy with a pencil, considering n²+g²=i² and n+g+i=1000 n<g<i note the following:

the largest value n can take is 332 with g=333 and i=335
the smallest value of i2-g2 is when g=(999-n)/2 and i=1000-g
if i2-g2 is greater than n2 then there can be no solution for this n with a smaller g

--Nigel Galloway (talk) 14:11, 31 August 2021 (UTC)