Re: [SPOILER] Re: Euler problem #187

anton@[EMAIL PROTECTED]
 (Anton Ertl) writes Re: [SPOILER] Re:
Euler problem #187

> mhx@[EMAIL PROTECTED]
 (Marcel Hendrix) writes:
> >anton@[EMAIL PROTECTED]
 (Anton Ertl) writes Re: [SPOILER] Re:
Euler problem #187
[..]
>>Your code, pasted into Gforth-fast, generates a number that is rejected
by 
>>the Euler solution checker?

> If I run it on a 64-bit system, the result is correct.  If I run it on
> a 32-bit system, or if I run it on iForth, it is too high by 1.  It's
> not obvious where the bug is.

You have strong evidence that the 64-bit system (and the algorithm)
are perfect? I can not read the code with these funny loops.

As there are only about 18 million numbers, one could write them to disk
and find the odd one out by comparing 64-bit and 32-bit output files.
Maybe you encountered a CPU/FPU bug in 64-bit mode :-)

-marcel