Re: The hardest Euler problem

In article <23370921183559@[EMAIL PROTECTED]
>, Marcel Hendrix <mhx@[EMAIL PROTECTED]
>
wrote:
>Albert van der Horst <albert@[EMAIL PROTECTED]
> writes Re: The hardest
Euler problem
>
>> 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.
>
>That's problem 177. Still some 137 to go for me :-)
>
>I have found that some problems are interrelated. E.g. solving the first
>prime problem makes the later prime problems a lot easier.

Couldn't find you in the scores yesterday. With 40 solved it is
easier : mhx.
I have solved three,  my nickname is albert.
Factoring a >32 bit number is a breeze on a 64 bit Forth.

>
>-marcel
>

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