In the classic "Crossing Ladders" problem, we are given the lengths and of two ladders resting on the opposite walls of a narrow, level street. We are also given the height above the street where the two ladders cross and we are asked to find the width of the street ().
Here, we are only concerned with instances where all four variables are positive integers.
For example, if , and , we can calculate that .
In fact, for integer values , , and , there are only five triplets producing integer solutions for : , , , and .
For integer values and , how many triplets produce integer solutions for ?
Write-up coming later
The complete problem is available here. An approach, code, and answer will be added later.