Hi.
At the moment i am trying to solve some euler problems, but the last one took me quite some time..
The problem is:

What is the smallest number that is <dfn title="divisible with no remainder">evenly divisible</dfn> by all of the numbers from 1 to 20?

I was able to calculate the solution, which is round about 232*10^6 but only if bigints are used.
In spite this is << 2^31 it does not work with normal ints, but i dont see why. Anyone here, who could help me out?

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

#light

let rec ggt n m =
    match m with
        | a when a=0I -> n
        | _ -> ggt m (n % m)
        
        
let kgv n m =
    match m,n with
    | a,b when (a,b) = (0I,0I) -> 0I
    | _,_ -> Operators.abs (n*m) / ggt m n  
   
let euler5 n =
    let sequ = seq {1I .. 1I ..n}
    Seq.fold kgv 1I sequ