-
For 8 character alpha-numeric, The probability of finding at least one non-unique sample among 1000000 (=10^6) samples, sampled uniformly at random from a set of 2821109907456 (≈3*10^12) items, is:
…
-
See comments in https://github.com/PDLPorters/PDL-Stats/pull/1.
-
Just came across this one ...
If you type this into wolfram alpha:
4((1/2)!^2)
The result is PI .
Maybe has to do with stirling formula or something similar(that is normaly only an approximati…
-
`Hypergeometric::new(100,50,49)` produces samples which are very likely not from this distribution.
The distribution is not very extreme, so I would expect this to sample correctly.
One piece of…
-
Currently doing 50000^100000 or 30000! will cause the CAS to hang, but if exponentiation approximation by logarithms and Stirling's factorial approximation are implemented, the CAS should be able to h…
-
I think most of the trigonometric operators like cos and sin and stuff are pointless, but gamma (the continuous factorial function) and its inverse deal with the domain of very large numbers, grow FAS…
-
logつくけど殴れる!みたいなのは除くものとする
library checkerのカテゴリ変更に対応していません
https://judge.yosupo.jp/
# New
- [ ] Matrix Product (Mod 2) (#364)
- [ ] Multiplication of Hex Big Integers
- [ ] Intersection of F_2 vec…
-
I do not think clients should send a lot of trust anchors. Nor do I think we should complicate the standard with a compression mechanism like this. It's good to think about though.
### Coding subse…
-
Right now we use a monte carlo calculator based on Emery's proof-of-concept C++ code that I transliterated into Java. The current calculators generally work well, but they are expensive which is an i…
-
While working on the presidential election example for the PPAML summer course, I discovered that our binomial sampler is pretty slow for values like `n = 2400000, p = 0.5`
We might try switching to …