What is the nice caml solution? On Tue, 16 Sep 2008, Jean Claude Coez wrote:
> This is part of an exam (2006) in computing science to enter the Ecole > Normale Superieure in France. Most of the students used Caml...I was > wondering if J could be a good alternative. > JC > > ----- Original Message ----- From: "Raul Miller" <[EMAIL PROTECTED]> > To: "Programming forum" <[email protected]> > Sent: Tuesday, September 16, 2008 11:42 AM > Subject: Re: [Jprogramming] pseudo-random sequence > > >> >> On Tue, Sep 16, 2008 at 4:50 AM, Jean Claude Coez <[EMAIL PROTECTED]> >> wrote: >>> Choose an integer U0 such that (0 < U0 <= 64006 ) >>> then define a pseudo-random sequence as: >>> Un+1 = ( 15091 * Un ) mod 64007 >>> while n < 40000 for instance. >>> >>> What would be a nice J solution ? (apart my ugly solution which I >>> don't dare >>> to show...) >> >> Nice for what purpose? >> >> -- >> Raul >> ---------------------------------------------------------------------- >> For information about J forums see http://www.jsoftware.com/forums.htm >> > > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm -- regards, ==================================================== GPG key 1024D/4434BAB3 2008-08-24 gpg --keyserver subkeys.pgp.net --recv-keys 4434BAB3 ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
