Page 1 of 1

m and n

Posted: Wed Apr 10, 2013 11:49 pm
by SANZEED
Let $m,n$ be positive integers. Prove that $(2^m-1)^2|(2^n-1)$ if and only if $m(2^m-1)|n$.

Source:Russia 1997

Re: m and n

Posted: Thu Apr 11, 2013 9:11 am
by Phlembac Adib Hasan
Hint:
$\gcd (a^m-1,a^n-1)=a^{\gcd (m,n)}-1$

Re: m and n

Posted: Thu Apr 11, 2013 3:48 pm
by zadid xcalibured
$2^m-1|2^n-1 \longleftrightarrow m|n$.Let $n=km$. As $2^m-1|\frac{2^n-1}{2^m-1}$
and $2^{m(k-1)}+2^{m(k-2)}+.............+1 \equiv k \equiv 0 (mod 2^m-1)$
\[\Longleftrightarrow 2^m-1|k\]
\[\Longleftrightarrow m(2^m-1)|n\]

Re: m and n

Posted: Sun Apr 14, 2013 7:37 pm
by Masum
https://www.awesomemath.org/assets/PDFs ... _Lemma.pdf
A general version, and applicable in many criteria. Particularly, this problem becomes one liner

Re: m and n

Posted: Sat Dec 14, 2013 8:00 pm
by Fm Jakaria
Masum wrote:https://www.awesomemath.org/assets/PDFs ... _Lemma.pdf
A general version, and applicable in many criteria. Particularly, this problem becomes one liner
Ithink problem 3 has a crack in the solution. How can we assume a and d relatively prime?