September 2017 Update
This commit is contained in:
Ingy döt Net
parent
bba7bfd280
commit
ba8067c3b7
14570 changed files with 153136 additions and 63871 deletions
|
|
@ -1,29 +1,25 @@
|
|||
/*REXX program counts the number of Pythagorean triples that exist given a maximum */
|
||||
/*──────────────────── perimeter of N, and also counts how many of them are primitives.*/
|
||||
trips=0; prims=0 /*set the number of triples, primitives*/
|
||||
parse arg N . /*obtain optional argument from the CL.*/
|
||||
if N=='' | N=="," then n=100 /*Not specified? Then use the default.*/
|
||||
|
||||
do a=3 to N%3; aa=a*a /*limit side to 1/3 of the perimeter.*/
|
||||
|
||||
do b=a+1 /*the triangle can't be isosceles. */
|
||||
ab=a + b /*compute a partial perimeter (2 sides)*/
|
||||
if ab>=N then iterate a /*is a+b ≥ perimeter? Try different A*/
|
||||
aabb=aa + b*b /*compute the sum of a²+b² (shortcut)*/
|
||||
|
||||
do c=b+1 /*compute the value of the third side. */
|
||||
if ab + c > N then iterate a /*is a+b+c > perimeter? Try diff. A.*/
|
||||
cc=c*c /*compute the value of C². */
|
||||
if cc > aabb then iterate b /*is c² > a²+b² ? Try a different B.*/
|
||||
if cc\==aabb then iterate /*is c² ¬= a²+b² ? Try a different C.*/
|
||||
trips=trips + 1 /*eureka. We found a Pythagorean triple*/
|
||||
prims=prims + (gcd(a,b)==1) /*is this triple a primitive triple? */
|
||||
end /*c*/
|
||||
end /*b*/
|
||||
end /*a*/
|
||||
|
||||
T=0; P=0 /*set the number of Triples, Primitives*/
|
||||
do a=3 to N%3; aa=a*a /*limit side to 1/3 of the perimeter.*/
|
||||
do b=a+1 /*the triangle can't be isosceles. */
|
||||
ab=a + b /*compute a partial perimeter (2 sides)*/
|
||||
if ab>=N then iterate a /*is a+b ≥ perimeter? Try different A*/
|
||||
aabb=aa + b*b /*compute the sum of a²+b² (shortcut)*/
|
||||
do c=b+1 /*compute the value of the third side. */
|
||||
if ab+c > N then iterate a /*is a+b+c > perimeter? Try diff. A.*/
|
||||
cc=c*c /*compute the value of C². */
|
||||
if cc > aabb then iterate b /*is c² > a²+b² ? Try a different B.*/
|
||||
if cc\==aabb then iterate /*is c² ¬= a²+b² ? Try a different C.*/
|
||||
T=T + 1 /*eureka. We found a Pythagorean triple*/
|
||||
P=P + (gcd(a, b)==1) /*is this triple a primitive triple? */
|
||||
end /*c*/
|
||||
end /*b*/
|
||||
end /*a*/
|
||||
_=left('', 7) /*for padding the output with 7 blanks.*/
|
||||
say 'max perimeter =' N _ "Pythagorean triples =" trips _ 'primitives =' prims
|
||||
say 'max perimeter =' N _ "Pythagorean triples =" T _ 'primitives =' P
|
||||
exit /*stick a fork in it, we're all done. */
|
||||
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
||||
gcd: procedure; parse arg x,y; do until y==0; parse value x//y y with y x; end; return x
|
||||
|
|
|
|||
|
|
@ -1,36 +1,31 @@
|
|||
/*REXX program counts the number of Pythagorean triples that exist given a maximum */
|
||||
/*──────────────────── perimeter of N, and also counts how many of them are primitives.*/
|
||||
@.=0; trips=0; prims=0 /*define some REXX variables to zero. */
|
||||
parse arg N . /*obtain optional argument from the CL.*/
|
||||
if N=='' | N=="," then n=100 /*Not specified? Then use the default.*/
|
||||
|
||||
do a=3 to N%3; aa=a*a /*limit side to 1/3 of the perimeter.*/
|
||||
aEven= a//2==0 /*set variable to 1 if A is even. */
|
||||
|
||||
do b=a+1 by 1+aEven /*the triangle can't be isosceles. */
|
||||
ab=a + b /*compute a partial perimeter (2 sides)*/
|
||||
if ab>=N then iterate a /*is a+b ≥ perimeter? Try different A*/
|
||||
aabb=aa + b*b /*compute the sum of a²+b² (shortcut)*/
|
||||
|
||||
do c=b + 1 /*compute the value of the third side. */
|
||||
if aEven then if c//2==0 then iterate
|
||||
if ab+c>n then iterate a /*a+b+c > perimeter? Try different A.*/
|
||||
cc=c*c /*compute the value of C². */
|
||||
if cc > aabb then iterate b /*is c² > a²+b² ? Try a different B.*/
|
||||
if cc\==aabb then iterate /*is c² ¬= a²+b² ? Try a different C.*/
|
||||
if @.a.b.c then iterate /*Is this a duplicate? Then try again.*/
|
||||
trips=trips + 1 /*Eureka! We found a Pythagorean triple*/
|
||||
prims=prims + 1 /*count this also as a primitive triple*/
|
||||
|
||||
do m=2; am=a*m; bm=b*m; cm=c*m /*generate non-primitives Pythagoreans.*/
|
||||
if am+bm+cm>N then leave /*is this multiple Pythagorean triple? */
|
||||
trips=trips+1 /*Eureka! We found a Pythagorean triple*/
|
||||
@.am.bm.cm=1 /*mark Pythagorean triangle as a triple*/
|
||||
end /*m*/
|
||||
end /*c*/
|
||||
end /*b*/
|
||||
end /*a*/
|
||||
|
||||
T=0; P=0 /*set the number of Triples, Primitives*/
|
||||
@.=0; do a=3 to N%3; aa=a*a /*limit side to 1/3 of the perimeter.*/
|
||||
aEven= a//2==0 /*set variable to 1 if A is even. */
|
||||
do b=a+1 by 1+aEven /*the triangle can't be isosceles. */
|
||||
ab=a + b /*compute a partial perimeter (2 sides)*/
|
||||
if ab>=N then iterate a /*is a+b ≥ perimeter? Try different A*/
|
||||
aabb=aa + b*b /*compute the sum of a²+b² (shortcut)*/
|
||||
do c=b + 1 /*compute the value of the third side. */
|
||||
if aEven then if c//2==0 then iterate
|
||||
if ab+c>n then iterate a /*a+b+c > perimeter? Try different A.*/
|
||||
cc=c*c /*compute the value of C². */
|
||||
if cc > aabb then iterate b /*is c² > a²+b² ? Try a different B.*/
|
||||
if cc\==aabb then iterate /*is c² ¬= a²+b² ? Try a different C.*/
|
||||
if @.a.b.c then iterate /*Is this a duplicate? Then try again.*/
|
||||
T=T + 1 /*Eureka! We found a Pythagorean triple*/
|
||||
P=P + 1 /*count this also as a primitive triple*/
|
||||
do m=2 while a*m+b*m+c*m<=N /*generate non-primitives Pythagoreans.*/
|
||||
T=T + 1 /*Eureka! We found a Pythagorean triple*/
|
||||
am=a*m; bm=b*m; cm=c*m /*create some short-cut variable names.*/
|
||||
@.am.bm.cm=1 /*mark Pythagorean triangle as a triple*/
|
||||
end /*m*/
|
||||
end /*c*/
|
||||
end /*b*/
|
||||
end /*a*/
|
||||
_=left('', 7) /*for padding the output with 7 blanks.*/
|
||||
say 'max perimeter =' N _ "Pythagorean triples =" trips _ 'primitives =' prims
|
||||
say 'max perimeter =' N _ "Pythagorean triples =" T _ 'primitives =' P
|
||||
/*stick a fork in it, we're all done. */
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue