Back to Questions
970
views1
comment
A best way
f#

Hi, i'm solving Euler Project problems and i give this statement:

"2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?"

Mi solutions is this find

LCM (20, LCM (19, LCM 18 ... LCM(1,2))))))))) ...

but I have a big problem, this does not work with numbers larger than 10. I give a Stack Overflow

My code:

let rec find vf =

let lcm a b =

let rec gcd (x, y) =
match (x, y) with
| (x, y) when y = 0 -> x
| _ -> gcd (y, x % y)

a * b / gcd (a, b)

match vf with
| 1 -> lcm vf 1
| _ -> lcm vf (find vf - 1)

How could use a List.fold here? or another funtional solution

.

Hi, here is one solution with Seq.fold.

let find vf =

let lcm a b =

let rec gcd (x, y) =
match (x, y) with
| (x, y) when y = 0 -> x
| _ -> gcd (y, x % y)

a * b / gcd (a, b)

seq { 1..vf } |> Seq.fold (fun s e -> lcm s e) 1

Regards

By on 5/6/2011 8:12 AM ()

    Topic tags

    IntelliFactory Offices Copyright (c) 2011-2012 IntelliFactory. All rights reserved.
    Home | Products | Consulting | Trainings | Blogs | Jobs | Contact Us | Terms of Use | Privacy Policy | Cookie Policy     		Built with WebSharper