I am having trouble proving this question. Can anyone help me out?
2026-05-16 23:20:20.1778973620
Let $r$ be the remainder of $a$ when dividing by $b$. Prove: $2^r -1$ is the remainder of $2^a -1$ when dividing by $2^b -1$
337 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
2

Let $b\equiv r\bmod a$. This implies $a \mid b-r$ and $r<a$. So $2^a-1\mid 2^{b-r}-1$ and hence $2^a-1\mid(2^{b}-1)-(2^r-1)$. Now observe $2^r-1<2^a-1$ and hence the remainder is $2^r-1$.