Show that a triangle whose side lengths are prime numbers cannot have integer area.
Problem
Source:
Tags: geometry, number theory
tenebrine
10.04.2021 02:16
Let the sides be $p, q, r$.
By Heron's $A = \sqrt{s(s-p)(s-q)(s-r)}$ where $s = \frac{p+q+r}{2}$.
If $p+q+r$ is odd then the area will have some factor of $\frac{1}{4}$ and thus not be an integer.
Otherwise, at least one of $p, q, r$ must be $2$. However then by triangle inequality, then we must have
$2, p, p$ for prime $p$.
Heroning this gives $\sqrt{(p+1)(p-1)}$, and $p^2 - 1$ is never a square for prime $p$.
@below yes oops
juliankuang
10.04.2021 02:19
Above: Doesn't $2, p, p$ work for any prime $p$?
jaov00
10.04.2021 02:42
A triangle with side lengths 2, p, p, wouldn't work. Take the side with length 2 as the base, the height would be √(p²–1). The area would then be 2√(p²–1)/2, or simply √(p²–1). I don't think this can every be rational.
natmath
10.04.2021 02:54
@above you are right, $\sqrt{p^2-1}$ can never be rational because the only squares who differ by 1 are $0,1$