Let $m$ and $n$ be positive integers such that $5m+ n$ is a divisor of $5n +m$. Prove that $m$ is a divisor of $n$.
Problem
Source: Dutch BxMO/EGMO TST 2015 p1
Tags: number theory, divisor, divides
24.08.2019 15:06
Let $\frac{5n+m}{5m+n}=k$ $(5-k)n=(5k-1)m$ As RHS is positive LHS should be positive. So, $5-k>0$ $k=1,2,3,4$ $k=1\implies m=n\implies m|n$ $k=2\implies n=3m\implies m|n$ $k=3\implies n=7m\implies m|n$ $k=4\implies n=19m\implies m|n$
24.08.2019 15:28
@above nice. Alternate solution. $5m+n|5n+m\implies 5m+n|24m$. Now assume to the contrary that $m\nmid n$. Let $n=mk+r$ where $0<r<m$. So, $$5m+n|24m\implies m(5+k)+r|24m\implies m|r$$which is not possible as $0<r<m$, hence a contradiction arises. Hence, $n|m$.
15.06.2021 09:30
amar_04 wrote: @above nice. Alternate solution. $5m+n|5n+m\implies 5m+n|24m$. Now assume to the contrary that $m\nmid n$. Let $n=mk+r$ where $0<r<m$. So, $$5m+n|24m\implies m(5+k)+r|24m\implies m|r$$which is not possible as $0<r<m$, hence a contradiction arises. Hence, $n|m$. @above why this ...if $24 = c [m(5+k) +r ]$ ...then?
16.12.2021 21:06
5m + n | 5n + m so there exists a k such that: (5m + n)k = 5n + m m(5k-1) = n(5-k) ---> k < 5 case 1 : k = 1 ---> 4m = 4n ---> m=n ---> m|n case 2 : k = 2 ---> 9m = 3n ---> 3m = n ---> m|n case 3 : k = 3 ---> 14m = 2n ---> 7m = n ---> m|n case 4 : k = 4 ---> 19m = n ---> m|n