Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Replies: 6   Last Post: Dec 29, 2012 2:37 AM

 Messages: [ Previous | Next ]
 John Conway Posts: 2,238 Registered: 12/3/04
Posted: Aug 23, 2001 12:46 PM

On 23 Aug 2001, Randall L. Rathbun wrote:

> My GP-Pari program will solve for the roots, using some type of numerical
> algorithm to hundreds of thousands of digits. But what I want to know, is
> the very nature of this problem intrinsically involve a quartic so that no
> matter how hard we try, it will always pop up?

I think the answer is "yes", even though I'm not quite sure exactly

Let me say what my "yes" means. If you're given the lengths a and
b of the two ladders, and the height h of their intersection,
then the distance x between the two vertical walls is given by a quartic
equation that is in general irreducible, although for particular values of
a,b,h it might just happen to have a rational root.

It's easy to find such values: we can suppose the bottom of the
picture looks like this:

\ /
X
/|\
15/ | \13
/ 12 \
|/___|___\|
9 5
for instance. Then obviously we have x = 14 and since the top half of
the figure will look like:

|\
| \13u /|
12u| \ 5v/ |4v
| \ / |
| 5u X 3v|

we must have

a = 13u + 13, where 5u = 9 and b = 15 + 5v, where 3v = 5,

giving a = 182/5, b = 70/3, h = 12, (for x = 14).

I rescale this to get a simpler case: multiplying by 15/14
gives

a = 39, b = 25, h = 90/7

for a problem whose answer is x = 15.

I wonder what the simplest rational solution is?

John Conway

Date Subject Author
8/21/01 Randall Rathbun
8/22/01 Virgil
8/23/01 Randall Rathbun
8/23/01 John Conway
8/24/01 Randall Rathbun
8/24/01 John Conway
12/29/12 Christo Kellerman