Timeline for Question about a new pseudo-random number generator

4 events

when toggle format	what		by	license	comment
Nov 11, 2020 at 0:33	vote	accept	Vincent Granville
Oct 7, 2020 at 9:30	comment	added	Vincent Granville		@ Acacia: Good point about not using the first $N$ digits, but rather $N$ digits starting at a position $m$ with $m$ large. I updated my question accordingly, using the notation $M$ instead of $m$, see section 'possible improvements'.
Oct 7, 2020 at 1:07	comment	added	Vincent Granville		This can be done without arithmetic operations, just bit operations (except to get the first $N$ digits of the seed). The choice of $\sqrt{2}/2$ was the most basic example in $[0, 1]$. In practice you are going to choose a number impossible to guess, such as (say) $\frac{11}{41} \log 17 +$ $ \sin(73\sqrt{97})\cdot $ $\arctan(e^{53}) + $ $(\frac{111}{71})^{\pi\log 7} +$ $\zeta(\frac{9}{5})\cdot $ $\Gamma(\pi^{\log 5})+ $ $ 131\psi_0(2^{-\sin 3})$.
Oct 7, 2020 at 0:32	history	answered	acacia	CC BY-SA 4.0