(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Two rivers of unequal width (64m and 125m) meet at a right angle, forming an L-shaped channel. What is the longest possible log you can float on it?

2. Relevant equations

3. The attempt at a solution

I tried for equal widths and built a recursive algorithm for turning the log. But it is getting stuck if the log is [tex]2\sqrt{2}(Width)[/tex]

**Physics Forums - The Fusion of Science and Community**

# Log in a river

Know someone interested in this topic? Share a link to this question via email,
Google+,
Twitter, or
Facebook

- Similar discussions for: Log in a river

Loading...

**Physics Forums - The Fusion of Science and Community**