Maybe this:
NChooseK Matrix( 40,6 )
Which makes a Matrix( 3838380, 6 ). You can use
As Table( NChooseK Matrix( 40, 6 ) )
if you want it in a table
lots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columnslots of rows, six columns
Hi Craig Hales,
Excellent answer!!, I supposed that JMP could do it and I didn't know how, a query......when placing NChooseK Matrix(40,6) as a script...there is no answer.....why?
Cheers,
Marco
Hi Craig Hales,
A query, related to multi-objective optimization... JMP will be able to optimize the uncertainty of random discrete inputs (integer numbers) in "1 single step"?...that is, JMP will be able to find the best combination of inputs to use (integer numbers) And the risk associated with each strategy?...and thus be able to look for strategies that allow minimizing the risks while achieving the objectives?
That is, take any optimization problem and have JMP replace the uncertain values by probability distribution functions (integers - discrete) that represent a range of possible values and for each trial solution that JMP finds during optimization, JMP run a Monte Carlo simulation, finding the combination of adjustable cells that provides the best simulation results that minimize risk in the face of uncertainty?.
Cheers,
Marco
The function returns a matrix, which you need to assign to a variable, or do something like astable. JMP's behavior when you submit multiple statements is to print the result of the final statement. If you submit just the nchoosekmatrix() then JMP will print it, and immediately forget the matrix.
Hello community!!
I am pleased to greet you, a question:
- With which DOE option will it be possible to generate a table with all possible combinations of 40 numbers in groups of 6 numbers without repetition?
- Could JMP generate tables of the following combinations without repetition of numbers?
Group Group/Total numbers Total possible combinations
A 5-35 324,632
B 6-35 1'623,160
C 6-40 3'838,380
B 6-45 8'145,060
Cheers,
Marco
