-
Pseudo random numbers can be generated quickly, when you need a lot of them. May be useful for Procedural generation or Monte Carlo simulation.
### haskell/random
#### High level
- [ ] [Ran…
-
Hola, es posible si nos pueden dar algunos números primos grandes (de 100 dígitos por ejemplo), para comprobar si nuestro algoritmo para el test de primalidad es correcto?
-
I have adopted Optimus assuming it would support integers up to 2^32-1.
Is there a technical reason why it is limited to 2^31-1? Is it that the method only works when the max integer is prime numbe…
-
Hello community.
Kindly consider:
```smalltalk
| n i r |
n := ( 2 ** 256 ) - 1 . "the largest 256-bit value"
i := ( 0 to: n ) . "the interval 0 to 2**256-1"
"Produce three sets of computed…
-
See https://en.wikipedia.org/wiki/Mersenne_prime. Basically check if something is of the form:
> Mn = 2n − 1
I've got no idea how difficult/easy this is in Javascript though.
-
There was a [request](https://groups.google.com/forum/#!topic/qiime-forum/CsQDqf7a7y0) for a seed on single rarefaction to make sure that rarefaction was repeatable.
This would be easy, and I envisio…
-
@mothur-westcott Our Regularized Random Forest Algorithm relies heavily on the use of RNG, I was wondering how good would be the default C++ RNG `rand()` function with respect to our needs. Most peop…
-
NumPy and Python both have Mersenne Twister PRNG implementation, but they differ in (1) how they initialize the state and (2) generate random numbers. Numba, while trying to support both implementati…
-
Hey. Kudos for chancejs, I find it a great piece of software.
Still I have a question / remark regarding the implementation of `name` generation.
The following puzzled me a bit when writing test…
iilei updated
6 years ago
-
See https://www.johndcook.com/blog/2019/03/14/irreducible-polynomials/. He has to use `sum(...)//n` instead of `sum(...)/n` because the computation produces floats. But if `divisors` returned `Integer…