Your skill will accomplish what the force of many cannot 

PerlMonks 
Don Coyoteby Don Coyote (Friar) 
on Jul 01, 2010 at 17:29 UTC ( #847566=user: print w/replies, xml )  Need Help?? 
Note: You cannot optimize code you have not yet written! Moving from scripting to programming handy thread for directions Sequence Lemma: A precursive sequence to the general pythagorean quadrance generation sequence. Usually the reduced Pythagorean Triples are the subject of the sequence. And it is such that this is essentially the square^{1} of a precursive sequence to the general pythagorean triples generator. Why not just work with the reduced triples? Do sequences require proofs like Theorems do? Are you pretending a sequence is a Theorem? [ n, nat 2>=n; ip, [ i, int[ m, nat 0>=m ] ] ; pOseq, {ip1,ip2,ip3} : pOseq(n) => L(Q), [ Q1, Q3, Q2 ] ] v0.01 this is going to take some time. _{1. Assuming the sequence can be squared. Currently I understand that it is allowable/doable.} _{2. ... ?} _{9. } 
