For any power of two m, then for any range size n (with m/2 < n <= m), the proba...

		jgtrosh on July 26, 2018 \| parent \| context \| favorite \| on: Efficiently Generating a Number in a Range For any power of two m, then for any range size n (with m/2 < n <= m), the probability of rejection is (m-n)/m. If any n is equally probable, then the average rejection is equal to the rejection of the average n (= 3*m/4): (m/4)/m = 1/4. This is true for any power of two m. I stand my case!

Hm, yeah not sure what I was thinking. Maybe expected number of attempts?