# Are the algorithms for picking between 2 numbers randomly a lot less computer intensive than the algorithms for picking almost any number randomly?

Are the algorithms for picking between 2 numbers randomly a lot less computer intensive than the algorithms for picking almost any number randomly? The definition of random for our purpose is anything that's random enough to be thought as being random by the general population. I am thinking it is true, but I wouldn't be able to say the exact reason why it would be the case.

• I don't think we can answer, since your definition of random is not really a definition. It's not clear whether you talk of fix-length computer numbers (in this case, just select each bit randomly) or of $\mathbb R$ (in this case, you must specify a distribution).
– user114966
Dec 6, 2020 at 17:32
• It's trivial to pick a natural number between 41 and 43 at random. Dec 6, 2020 at 17:56
• (There are "RNG"s giving values in [0, 1), to be scaled and shifted as needed.) Dec 6, 2020 at 17:57