Pairs of integers
Find infinitely many pairs of integers $(a,b)$ such that $1<a<b$ and $ab$ divides $a^{2}+b^{2}-1$. Also find all positive integers $k$ such that there exists $(a,b)$ such that $\frac {a^{2}+b^{2}-1}{ab}=k$.
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
-
Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: Pairs of integers
Take $a>1,\; b=a^2-1$. Then $\dfrac {a^2+b^2-1}{ab}=a=$ Any integer greater than $1$. $\dfrac {a^2+b^2-1}{ab}=1$ is not possible because it will imply $(a-b)^2=1-ab<0$ since $ab>1$. So all the $\{k\}=\mathbb N\backslash 1$SANZEED wrote:Find infinitely many pairs of integers $(a,b)$ such that $1<a<b$ and $ab$ divides $a^{2}+b^{2}-1$. Also find all positive integers $k$ such that there exists $(a,b)$ such that $\frac {a^{2}+b^{2}-1}{ab}=k$.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules
Re: Pairs of integers
We use Vieta Jumping to solve this problem.SANZEED wrote:Find infinitely many pairs of integers $(a,b)$ such that $1<a<b$ and $ab$ divides $a^{2}+b^{2}-1$. Also find all positive integers $k$ such that there exists $(a,b)$ such that $\frac {a^{2}+b^{2}-1}{ab}=k$.
