## Pairs of integers

For discussing Olympiad Level Number Theory problems
SANZEED
Posts: 550
Joined: Wed Dec 28, 2011 6:45 pm

### 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!}}$

Posts: 1016
Joined: Tue Nov 22, 2011 7:49 pm
Location: 127.0.0.1
Contact:

### Re: Pairs of integers

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$.
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$
Welcome to BdMO Online Forum. Check out Forum Guides & Rules

harrypham
Posts: 12
Joined: Wed Aug 31, 2011 12:31 pm
Location: Vietnam
Contact:

### Re: Pairs of integers

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$.
We use Vieta Jumping to solve this problem.