Administrators, writer
2,824
edits
Changes
Jump to navigation
Jump to search
Line 21:
Line 21: + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Array.cartesianproduct() (view source)
Revision as of 17:35, 16 February 2020
, 17:35, 16 February 2020→Array.cartesianproduct()
3 3
3 3
To find all Pythagorean Triplets between 1..10, do:
[1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r))))
s sd sdf dsf sdf sdf dsf
z^3/Javascript Code Editor … ⇕ ◱ ✕
[1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r))))
1
[1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r))))
{| style="" id="TABLE58" class="null wikitable" donotcaption="true" |
|-
| 3
| 4
|-
| 4
| 3
|-
| 6
| 8
|-
| 8
| 6
|}