From the wikipedia article:
You don't really need a separate explicit parameter for k; you can just let m and n get suitably large and test
if ((((m - n) % 2) == 1) &&...
Type: Posts; User: Zaphod_b
Re: A linearithmic (at most) complexity algorithm to generate Pythagorean triples
From the wikipedia article:
You don't really need a separate explicit parameter for k; you can just let m and n get suitably large and test
if ((((m - n) % 2) == 1) &&...
Re: A linearithmic (at most) complexity algorithm to generate Pythagorean triples
An approach that worked for me: A couple of comments from my Java source:
//
// To generate all triples of interest up to a given number:
//
// Generate all primitive triples and their...