http://www.mapleprimes.com/questions/142100-Iterative-Process en-us 2026 Maplesoft, A Division of Waterloo Maple Inc. Maplesoft Document System Tue, 09 Jun 2026 10:03:05 GMT Tue, 09 Jun 2026 10:03:05 GMT The latest answers and comments added to the Question, iterative process http://www.mapleprimes.com/images/mapleprimeswhite.jpg http://www.mapleprimes.com/questions/142100-Iterative-Process http://www.mapleprimes.com/questions/142100-Iterative-Process?ref=Feed:MaplePrimes:iterative process:Comments#answer142102 <p>Something like this works:</p> <p>L:=seq(1/n,n=1..100): <br>f:=(M,N)-&gt;M+N+M*N;<br>while nops([L])&gt;1 do <br>&nbsp;&nbsp; n,m:=op(combinat:-randcomb(nops([L]),2)); #Two random indices in the range 1..nops([L])<br>&nbsp;&nbsp; L:=f(L[n],L[m]),L[1..n-1],L[n+1..m-1],L[m+1..-1] <br>end do: <br>L;<br><br></p> <p>Something like this works:</p> <p>L:=seq(1/n,n=1..100): <br>f:=(M,N)-&gt;M+N+M*N;<br>while nops([L])&gt;1 do <br>&nbsp;&nbsp; n,m:=op(combinat:-randcomb(nops([L]),2)); #Two random indices in the range 1..nops([L])<br>&nbsp;&nbsp; L:=f(L[n],L[m]),L[1..n-1],L[n+1..m-1],L[m+1..-1] <br>end do: <br>L;<br><br></p> 142102 Sun, 06 Jan 2013 18:47:12 Z Preben Alsholm Preben Alsholm