We are trying to find a hidden number selected from the set of integers $\{1, 2, \dots, n\}$ by asking questions. Each number (question) we ask, has...
Let $a_n$ be a sequence recursively defined by:$\quad a_1=1,\quad\displaystyle a_n=\biggl(\sum_{k=1}^{n-1}k\cdot a_k\biggr)\bmod n$. So the first $10$ elements of $a_n$ are: $1,1,0,3,0,3,5,4,1,9$. Let $f(N, M)$ represent the number...
Let $y_0, y_1, y_2, \dots$ be a sequence of random unsigned $32$-bit integers (i.e. $0 \le y_i \lt 2^{32}$, every value equally likely). For the sequence $x_i$...