List.map (fun n -> n * n * n) list
printfn "Cubes of [2; 4; 6]: %A\n"
let rec Factorial n : bigint =
| n when n = bigint (1) ->
| _ -> n * Factorial(n - bigint (1))
/ (Factorial(k) * Factorial(n - k))
(C (bigint (20)) (bigint (5)))
let vecadd l1 l2 = List.map2 (+) l1 l2
"vecadd [1;2;3] [4;5;6]: %A\nvecadd [1;2;-3;4][4;-5;6;7]: %A\n"
(vecadd [ 1; 2; 3 ] [ 4; 5; 6 ])
| m1 :: m1tail, m2 :: m2tail ->
:: (matadd m1tail m2tail)
"matadd [[1;4]; [2;5;] [3;6]], \n\t\t[[7;1]; [8;2]; [9;3]]:\n\t\t\t%A"