Skip to content

Project Euler Problem 48

November 26, 2011

Project Euler Problem 48 solution:

open System.Numerics

let lastTen = 10000000000I

let problem048 () =
    [1I..1000I]
    |> Seq.fold (fun acc i -> acc + bigint.ModPow(i,i,lastTen)) 0I
    |> fun x -> bigint.ModPow(x,1I,lastTen)
Advertisements

From → Project Euler

Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: