Re: Euler Top 1000

In article <97123519173559@xxxxxxxxxxxxxx>, Marcel Hendrix <mhx@xxxxxx> wrote:
Albert van der Horst <albert@xxxxxxxxxxxxxxxxxx> writes Re: Euler Top 1000
[..]
I have not yet stopped (32 now). 80 is the score to hit,
I'm not sure whether I have the stamina. There are certainly
some of the 50 problems I can handle. Some may look uninteresting
(evaluating poker hands) but it remains a challenge to program that
in a clean way.

I am counting on you to boost Forth's ranking :-)

The score for a language is calculated as
(average solutions/user) * log (number of users). So the best
investment of time is too help and stimulate the currently listed
Forthers with low scores.

Interesting, I was wondering how a score was calculated.

<SNIP>


Some Top 1000 scorers are using pencil and paper.

Not for problem 196 and all other problems where counting
primes or sums of primes are involved. That would require a
phenomenal break through in mathematics.


I *was* very happy indeed with my 64 bit lina, though. Saves
a lot of double precision stuff.

That could help for a few problems, but I think some are specifically
designed to make this easy way out impossible.

You didn't yet solve Problems 69, 70 and 72, and 53.
The puzzles 55, 56, 57, 65, 78, 80 are also fun (in this respect).


69 : more appropriate string of digits, no bignums
70 : and other totient stuff, pretty easy (knowing the math)
72 : idem
53 : You need not calculate a number to know that it exceeds
a million.

My guess is that none of these need even double precision on
a 32-bits Forth. We'll see.
These are the nice simple problems I do when I get frustrated.

The problem of summing the digits of a^b is the worst problem
to do without a bignum library. There is also this list of
numbers of the form 2898298^1819891 finding the largest one.
There may be an interesting trick to do those in fixed point.
Doing it with floating point and logarithms is trivial and
boring.

We'll see.

-marcel

Groetjes Albert

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

.

Relevant Pages

  • Re: float bug? perl 5.8, DBI and oracle 10.2.0
    ... precision numbers in oracle, you've got 38 decimal digits to play ... and with minimal coaxing perl will handle them as ... digits from a 32 bit floating point number - I'll go out on a limb ... and hazard that one can expect 12 or so digits from a 64 bit floating ...
    (perl.dbi.users)
  • RE: float bug? perl 5.8, DBI and oracle 10.2.0
    ... I would not characterise 32-bit signed integers as giving 10 digits ... truncate and tell people you get 9 digits of precision. ... perl 5.8, DBI and oracle 10.2.0 ... Floating point values are typically stored in 64 bits or sometimes 96 ...
    (perl.dbi.users)
  • Re: float bug? perl 5.8, DBI and oracle 10.2.0
    ... I would not characterise 32-bit signed integers as giving 10 digits ... truncate and tell people you get 9 digits of precision. ... perl 5.8, DBI and oracle 10.2.0 ... Floating point values are typically stored in 64 bits or sometimes 96 ...
    (perl.dbi.users)
  • Re: 15 Significant Digits Limitation a Mistake for Spatial Informa
    ... DP does not restrict to 15 decimal digits. ... Input and output precision are more tightly linked in Excel ... Decimal data type or roll your own extended precision data types. ...
    (microsoft.public.excel)
  • Re: Theoretical questions raised by tidbits
    ... > Another poster noticed that with the ... > where you can see the pattern again, though there's that -2 stuck on ... > counting composites is a way to count primes. ...
    (sci.math)
Loading