Skip to content

Project Euler Problem 25

November 17, 2011

Project Euler Problem 25 allows to compose the solution of pieces done earlier: reusing the code from Project Euler Problem 2 solution adopted for infinite Fibonacci sequence makes the code succinct:

let inline nDigits n = String.length <| (n.ToString())

let fibnums =
    Seq.unfold (fun (current, next) ->
        Some(current, (next, current+next)))(0I,1I)

let problem025 () =
    |> Seq.takeWhile (fun x -> nDigits x < 1000)
    |> Seq.length

From → Project Euler

Leave a Comment

Leave a Reply

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

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

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s

%d bloggers like this: