Re: The hardest Euler problem

In article <k08mta.10o@[EMAIL PROTECTED]
>,
Albert van der Horst  <albert@[EMAIL PROTECTED]
> wrote:
>I have sorted the Euler problems from hardest to easiest,
>and indeed the most interesting ones come up front.
>
>This one gets me particularly stunned.
>
>Find all quadrilaterals with angles (including those with diagonals).
>that can be measured in whole degrees.
>So a square fits the bill, because all those angles are 45 degrees.
>They give an example of a non-trivial example with 20 and 50
>degrees.
>
>I cannot come up with something better than this
>- guess all angles except one.
>- calculate the last one using goniometric functions.
>The problem states that if it is within 10-9 of a whole degree, it is
>acceptable as a whole degree.
>This is of course a nasty calculation.
>Using fixed point calculations would even me more cumbersome.
>I cannot find a way to do it exactly which would be more gratifying,
>if only mathematically.

I have found that it is equivalent to the following problem.

Put 180 markers on a circle, evenly.
Now connect three pairs of points. How many of those triples of
lines go through one point?
(The common point and three adjacent points on the circle
form the quadrilateral sought for.)

This doesn't help me to get rid of approximations and
floating point calculations.

>
>Takers anyone?
>
>Groetjes Albert
>
>--
>--
>Albert van der Horst, UTRECHT,THE NETHERLANDS
>Economic growth -- like all pyramid schemes -- ultimately falters.
>albert@[EMAIL PROTECTED]
 &=n http://home.hccnet.nl/a.w.m.van.der.horst
>


--
-- 
Albert van der Horst, UTRECHT,THE NETHERLANDS
Economic growth -- like all pyramid schemes -- ultimately falters.
albert@[EMAIL PROTECTED]
 &=n http://home.hccnet.nl/a.w.m.van.der.horst