From: fateman@gmail.com   
      
   Can someone explain how this is even plausible as a method to use for symbolic   
   integration?   
      
   Some probabilistic algorithms are used in computer algebra systems.. They work   
   like this:   
   The system will pick a "random" number  (perhaps a random prime number less   
   than half the word size of   
   the computer you are using).   If it picks a lucky number, the algorithm   
   finishes fast.   
   If it pick an unlucky number, the algorithm notices that this is an unlucky   
   number, and picks another one.   
   If it runs out of picks, the algorithm gives up with "failure of algorithm".   
      
   At no time is it acceptable for the algorithm to give a wrong answer, or for   
   the answer to depend on the   
   particular first choice of a number.   
      
   It seems that this program is just wrong if it depends on the random number   
   generator's seed being 12.   
      
   RJF   
      
   On Sunday, September 4, 2022 at 10:24:56 AM UTC-7, Jeff Barnett wrote:   
   > On 9/4/2022 1:21 AM, Nasser M. Abbasi wrote:   
   > > On 9/3/2022 11:25 PM, Jeff Barnett wrote:   
   > >> I would either   
   > >> give the system a fail because it is unreliable on that problem or I   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)