Problem
I was reading the question Why is the smallest Pythagorean triple $(x,y,z)=(3,4,5)$ not close (in ratio $x/y$) to any other small triple?. I came up with this question:
Let $(a, b, c)$ be a Pythagorean tuple where $a < b < c$. What is the maximum possible value of $a / b$?
(A triple $(a, b, c)$ is a Pythagorean triple if $a, b, c \in \mathbb{Z}^+$ and $a^2 + b^2 = c^2$)
My attempt
I am aware of Euclid's formula$^1$ $$ a = 2mn, \qquad b = m^2 - n^2, \qquad c = m^2 + n^2. \qquad (m,n \in \mathbb{Z}^+, m > n)$$ Therefore, $$ \frac{a}{b} = \frac{2mn}{m^2 - n^2}. $$ Now, how can I maximize it? I can't see a lot of connection between the numerator and the denominator.
$^1$ It turns out that this step is wrong — it fails to consider the case where $2mn > m^2 - n^2$.
There are infinitely many Pythagorean triples $(a, b, c)$ with $b=a+1$, see for example
Wikipedia: Pythagorean triple:
The Proof of Infinitude of Pythagorean Triples $(x,x+1,z)$
An infinite set of positive integers is necessarily unbounded, therefore $$ \frac{a}{b} = 1 - \frac{1}{a+1} $$ can be arbitrarily close to one for these triples.