How can I find all positive of $k$ and $n$ such that $$\frac {2^n-1}{3^k}$$ is an integer? I know that $$2^n-1\equiv 0\pmod 3$$ If $n=2p$ with $p$ integer , $$2^n-1\equiv 0\pmod 9$$ If $n=6p$, $$2^n-1\equiv 0\pmod {27}$$ if $n=18p$, and continuing I can find all solutions but is there a general formula?

  • $\begingroup$ The obvious pattern so far is that the coefficient of $p$ is multiplied by $3$ each time. $\endgroup$ – Arthur Jun 3 '15 at 18:58

Let $\, \upsilon_p(n)\, $ satisfy $\, p^{\upsilon_p(n)}\mid n\, $ and $\, p^{\upsilon_p(n)+1}\nmid n$.

Lifting The Exponent Lemma (LTE):

$a\equiv b\not\equiv 0\pmod{\! p}$,$\ p$ odd prime $\,\Rightarrow\ \upsilon_p(a^n-b^n)=\upsilon_p(a-b)+\upsilon_p(n)$

$3\mid 2^n-1\,\Rightarrow\ n=2m$ for some $m\in\Bbb Z^+$


Solutions: $(k,n)=(x,2m)$ for any $x,m\in\Bbb Z^+$ with $x\le 1+\upsilon_3 (m)$.

  • $\begingroup$ Thanks I wanted to use this theorem but I didn't note a stupid thing therefore I proved to solve in another way $\endgroup$ – Domenico Vuono Jun 3 '15 at 19:07

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.