Comments on: Project Euler in F# – Problem 48

By: Winston Smith

Winston Smith — Wed, 18 Aug 2010 12:04:06 +0000

I think the whole point of this puzzle is that you DON’T use BigInt or a similar library.

Otherwise it’s trivial, as your code demonstrates.

claudio — Sun, 04 May 2008 08:50:18 +0000

Hi Salvo,
your idea can be implemented with this code:

let answer = [1I .. 1000I] |> Seq.map (fun x -> pow x x) |> Seq.map last10 |> Seq.fold (+) 0I

However, the sum of all these 10-digits numbers results in a number (4629110846700) which contains 13 digits!

We are actually forced to apply the last10 function another time at the end…

Salvo — Sat, 03 May 2008 16:05:20 +0000

…mmm…

Ciao Claudio.

And if you generate the sequense of pow, next map the last10 function for each pow and at end sum all the numbers?

…mmm…

claudio — Thu, 01 May 2008 19:25:49 +0000

I agree that your solution may be easier to understand, but it is not written according to the functional programming paradigm, is it?

BTW, which language is that? Python? Ruby?

Filippo — Thu, 01 May 2008 09:14:29 +0000

I don’t want to be a troll but this:

number = 0
for e in xrange(1000):
number += e ** e
str(number)[-10:]

seems to be easier and (a bit) more readable.
HAND