Difference between revisions of "Array.cartesianproduct()"
Jump to navigation
Jump to search
| Line 25: | Line 25: | ||
[1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r)))) | [1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r)))) | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
{| style="" id="TABLE58" class="null wikitable" donotcaption="true" | | {| style="" id="TABLE58" class="null wikitable" donotcaption="true" | | ||
Revision as of 11:36, 16 February 2020
Array.cartesianproduct()
Returns cartesian product of each array element in the array.
[1..3,2..3].cartesianproduct()
1 2
1 3
2 2
2 3
3 2
3 3
To find all Pythagorean Triplets between 1..10, do:
[1..10,1..10].cartesianproduct().filter(r=>ISINTEGER(SQRT(SUMSQ(r))))
| 3
|
4
|
| 4
|
3
|
| 6
|
8
|
| 8
|
6
|