Uniform Random Number Algorithm

[parisse]

Actually the Prime CAS does not use the Mersenne Twister, while giac/xcas does, more precisely tinymt32.c which has the following copyright header

Code:

/**
 * @file tinymt32.c
 *
 * @brief Tiny Mersenne Twister only 127 bit internal state
 *
 * @author Mutsuo Saito (Hiroshima University)
 * @author Makoto Matsumoto (The University of Tokyo)
 *
 * Copyright (C) 2011 Mutsuo Saito, Makoto Matsumoto,
 * Hiroshima University and The University of Tokyo.
 * All rights reserved.
 *
 * The 3-clause BSD License is applied to this software, see
 * LICENSE.txt
 */

The Prime CAS is using a congruential generator:

Code:

 r = unsigned ((1664525*ulonglong(r)+1013904223)%(ulonglong(1)<<31));