My professor asked me to present a proof to my fellow students tomorrow that
$$\left\lceil\frac{n}{2^k}\right\rceil = \left\lceil\frac{\left\lceil\frac{n}{2^{k-1}}\right\rceil}{2}\right\rceil$$
I tried to prove it as follows, but I am not sure if my proof is correct.
Proof
The above is equivalent to $$\left\lceil\frac{n}{2^{k+1}}\right\rceil = \left\lceil\frac{\left\lceil\frac{n}{2^k}\right\rceil}{2}\right\rceil$$
Let us say that $x = \left\lceil\frac{n}{2^{k+1}}\right\rceil$ for ease of notation.
It is then clear that $$x-1 \lt \frac{n}{2^{k+1}} \le x$$
We will now prove what is asked using contradiction. Assume that $$\left\lceil\frac{n}{2^{k+1}}\right\rceil \lt \left\lceil\frac{\left\lceil\frac{n}{2^k}\right\rceil}{2}\right\rceil$$ Then there is an integer $a$ such that $$\left\lceil\frac{n}{2^{k+1}}\right\rceil \le a \lt \left\lceil\frac{\left\lceil\frac{n}{2^k}\right\rceil}{2}\right\rceil$$
This is equivalent to $$\left\lceil\frac{n}{2^k}\right\rceil \le 2*a \lt \frac{n}{2^k}$$ which can obviously not be true.
QED
Do you see any errors in my proof? Is it clear? I'm a bit doubtful about the last step, where I multiply $a$ by 2.