With given $a , b \in \mathbb{N} $, is there any way to find the smallest $ k \in \mathbb{N} $ that satisfies the following inequality (without trying for $k=1,2,...$):
$$2^k - (bk + a) \ge 0 $$
With given $a , b \in \mathbb{N} $, is there any way to find the smallest $ k \in \mathbb{N} $ that satisfies the following inequality (without trying for $k=1,2,...$):
$$2^k - (bk + a) \ge 0 $$
You can study the function $(0,\infty)\ni x\mapsto 2^x-(bx+a)$. Its derivative is $x\mapsto 2^x \ln 2 -b$. Its derivative is positive on... and negative on...