Talk:Special pythagorean triplet: Difference between revisions
Final solution? Last guess? See the F# which seems to work even if this description is still confused!
No edit summary |
(Final solution? Last guess? See the F# which seems to work even if this description is still confused!) |
||
Line 1:
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<sup>2</sup>+g<sup>2</sup>=i<sup>2</sup> and n+g+i=z n<g<i note the following:
the largest value n can take is
the smallest value of i<sup>2</sup>-g<sup>2</sup> is when g=(z-1-n)/2 and i=z-g
if i<sup>2</sup>-g<sup>2</sup> is greater than n<sup>2</sup> then there can be no solution for this n with a smaller g
Line 17:
The task description says there is only one triple with a + b + c = 1000, so it must be a primitive one. --[[User:Tigerofdarkness|Tigerofdarkness]] ([[User talk:Tigerofdarkness|talk]]) 18:14, 31 August 2021 (UTC)
I have added three observations to the list above which remove the requirement for searching which I think may need explanation. For a given n when
| |||