Re: project euler 29

[Ben Bacarisse <ben.usenet@bsb.me.uk>]

Paul Rubin <no.email@nospam.invalid> writes:

> Ben Bacarisse <ben.usenet@bsb.me.uk> writes:
>>> So you just loop through 1 <= a,b <= 100 and count only the a,b pairs
>>> where a is the smallest a for its equivalence class.
>> This is likely to be fast which is why I wanted to compile Francesc's to
>> try it out.  Mind you, a naive a^b == c^d test gives pretty good
>> performance for the kind of range requested.
>
> But Francesc's program doesn't use that method.  It only suggests it in
> a comment.  The program actually works by building a list, sorting it,
> and counting the groups.

I only looked briefly and thought it used the factor method to decide if
the power is one that occurs earlier in the sequence.  Two trivial
things, starting with Answer as the full NxN count and then decrementing
Answer made me think that was what it was doing.

-- 
Ben.