BdMC-Not So Easy II problem 5

For discussing Olympiad Level Number Theory problems
User avatar
SANZEED
Posts:550
Joined:Wed Dec 28, 2011 6:45 pm
Location:Mymensingh, Bangladesh
BdMC-Not So Easy II problem 5

Unread post by SANZEED » Thu Apr 11, 2013 11:42 pm

Find all pairs of $(a,b)$ such that for all $n\in \mathbb{N}$,
$a\left \lfloor bn \right \rfloor=b\left \lfloor an \right \rfloor$
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$

User avatar
*Mahi*
Posts:1175
Joined:Wed Dec 29, 2010 12:46 pm
Location:23.786228,90.354974
Contact:

Re: BdMC-Not So Easy II problem 5

Unread post by *Mahi* » Fri Apr 12, 2013 11:51 pm

Hint:
\[\frac ab = \frac {\left \lfloor na \right \rfloor}{\left \lfloor nb \right \rfloor} =\frac {\{na\}} {\{nb\}} \forall n\]
Where $\left \lfloor a \right \rfloor$ and $\{a\}$ are respectively floor and fractional part of $a$.
Please read Forum Guide and Rules before you post.

Use $L^AT_EX$, It makes our work a lot easier!

Nur Muhammad Shafiullah | Mahi

Post Reply