Today I came up to an interesting problem that i would like to share with the ME community to the enjoy of the reader. The initial problem (which has $2$ almost equivalent statements) was about integer sides in a triangle. This problem is (not very surprisingly) equivalent to a bit challenging problem about Diophantine-equations
Statement $1$
Let $\triangle ABC$ be an isosceles triangle with $\overline{BC}=\overline{CA}$. Consider the height $AD$ over side $BC$, with $D$ being the base of the height. Find all triangles such that $\overline{BD}, \overline{DC}, \overline{AB}, \overline{AD} \in \mathbb{N}$ (or $\in \mathbb{Z}$ if you consider directed lenghts)
Statement $2$
Let $\Omega$ be a circle with center $O$. Consider a radius $OA$, and a point $B \in OA$. Denote $C$ the point that results from the intersection of $\Omega$ with a perpendicular line to $OA$ through $B$. Find all possible configurations such that $\overline{OB}, \overline{BA}, \overline{BC}, \overline{CA} \in \mathbb{N}$ (or $\in \mathbb{Z}$ if you consider directed lenghts)
Hint
Letting $u=\overline{OB}, v = \overline{BA}$, the problem es equivalent to solve the following system of Diophantine equations:\begin{align}(u+v)^2 - u^2 = v(2u +v)= x^2 \\(u+v)^2 - u^2 + v^2 = 2v(u+v) =z^2\end{align} Now, $z$ is even, so $z=2y$ and we have to solve the following system\begin{align} v(2u +v)= x^2 \\ v(u+v) = 2y^2 \end{align}
Hints: As can be seen in figure AB, AD and DB are Pythagorean triples such that:
$DB=2 k+1$, $AD=2k(k+1)$ and $AB=2k(k+1)+1$; $k\in N$
Similarly AD , DC and AC follow the same relation. That is we can always construct such triangles with required constrains. This helps you to solve the equation you found.