7 years, 61 days

## @Carl Love No, i got pm, it'a is ra...

@Carl Love
No, i got pm, it'a is rank of a list z and number of lines i m adding in getone, this corrent getone function is test, the one i need minimization for looks a bit diferent, but she dont give corrent value all the time, thet why i give this one in exemple, but this not changing the problem. So exctualy i need make optimization for [[z1,z2,z3,z4,z5],[z6,z7,z8,z9,z10]....[zn-4,zn-3,zn-2,zn-1,zn]] with one randomly generated initial point, and number of elements to optimaze depend on pm rank. And main problem is how set all this optimization values, number of which depends of pm.

## @Carl Love  Sorry, i m realy bad in...

Sorry, i m realy bad in description of my thoughts and i I have not included function getone to the description.
So now, simplified looks like this.
for_primes_1.mw

getone := proc (lpoint, pps) global x, y;

Warning, `pm` is implicitly declared local to procedure `getone`

Warning, `pp` is implicitly declared local to procedure `getone`

 (1)

Thank for your advice, using [`\$`('Roll()', pm)] much easier then using loop, and i uploaded DirectSearch package, i ectualy already got it in lib, but forgot about it.
And the quastions, thet i described such badly last time, is how make all thet two dementional z::list, to be variable for optimisation?

## Mostly educational purpose...

@acer Mostly educational purpose, it use random to determinate event, smth like a Monte Carlo method.

At this input parameters it makes only 100events , this is not enough to get tolerens so its cant find f(x)=0 piont, and ectualy i m not sure is this point exist in such configuration of program, but in very simular configuration, using only 2 veribels i was finding f(x,y)<0.01 with 10000 events using self writed nonlinear conjugate gradient method.But now i can use globalopt and change program propetly, or remade it using Markov chain