Divisibility with a and b

For discussing Olympiad Level Number Theory problems
Katy729
Posts:47
Joined:Sat May 06, 2017 2:30 am
Divisibility with a and b

Unread post by Katy729 » Sat May 06, 2017 10:12 am

Determine all ordered pairs $(a,b)$ of positive integers for which $\dfrac{b^3-1}{ab-1}$ is an integer.

User avatar
Atonu Roy Chowdhury
Posts:64
Joined:Fri Aug 05, 2016 7:57 pm
Location:Chittagong, Bangladesh

Re: Divisibility with a and b

Unread post by Atonu Roy Chowdhury » Thu May 11, 2017 10:37 pm

$\frac{b^3-1}{ab-1}=x$
Firstly notice that if $(a,b)$ is a solution, then $(b,a)$ is also a solution. So, we may assume wlog $a \ge b$ .

If $b=1$, $x=0$ . So, we got a solution $(a,1)$ where $a>1$ .

Now consider the case $b \ge 2$ . $x>0$. Notice that $x \equiv 1 (mod b)$ . So, $x=nb+1$ . As $a \ge b$ , $nb+1=\frac{b^3-1}{ab-1} \le \frac{b^3-1}{b^2-1} = \frac{b^2+b+1}{b+1} < b+1$ implies $n<1$ . So, $n$ must be $0$ . $\frac{b^3-1}{ab-1}=1$ implies $a=b^2$
This was freedom. Losing all hope was freedom.

Katy729
Posts:47
Joined:Sat May 06, 2017 2:30 am

Re: Divisibility with a and b

Unread post by Katy729 » Sat May 13, 2017 4:24 pm

Very simple and clear! Thanks :)

Post Reply