Обход делителя и взаимнопростые

let rec euler (startnumber:float) eps numFact funFact = 
    match startnumber with 
    |startnumber when 1.0/(funFact numFact) > eps -> euler (startnumber + (1.0/(funFact numFact))) eps (numFact+1.0) funFact 
    |startnumber -> startnumber
 
let rec factorial number = 
    match number with 
    |number when number>1.0 ->number*factorial(number-1.0) 
    |number -> 1.0

let rec nod number1 number2 number3 = 
    match number3 with 
    |number3 when number1>0 && number2 >0 && number1>number2 -> nod (number1%number2) number2 number3 
    |number3 when number1>0 && number2 >0 && number1<number2 -> nod number1 (number2%number1) number3 
    |number3 -> number1+number2

let rec euler startnumber eps numFact maxFact funFact = 
    match startnumber with 
    |startnumber when (1.0/(funFact numFact) > eps) && numFact<maxFact -> euler (startnumber + (1.0/(funFact numFact))) eps (numFact+1.0) maxFact funFact 
    |startnumber -> startnumber//printfn "euler for div : %f" startnumber 
 
 
let rec factorial number = 
    match number with 
    |number when number>1.0 ->number*factorial(number-1.0) 
    |number -> 1.0 
 
  
let rec Divisor number currentNumber funEulerDivisor = 
    let d = fun (x:float) -> euler 0.0 0.00001 1.0 number factorial 
    match number with 
    |number when number = 0 -> 0
    |number when (currentNumber%number=0) -> Divisor (number-1) currentNumber (d number)
    |number -> Divisor (number-1) currentNumber funEulerDivisor 
 
 
[<EntryPoint>] 
 
let main argv =  
    let divisorEuler = fun fEulerDiv (x:int) (y:int) eulerdiv -> printfn "Эйлерого число делителей числа %d : %d"  x (fEulerDiv x y eulerdiv) 
    divisorEuler Divisor 5 5 euler 
    0 // возвращение целочисленного кода выхода

let rec gcd a b =
    if b = 0 then a
    else gcd b (a % b)
    
let gcd3 a b c =
    gcd (gcd a b) c

// Ошибка компиляции: The type 'float' does not match the type 'int'
let test (x: int) = x * 2.0 
 
// Нужно использовать явное приведение типов
let test (x: int) = (float x) * 2.0

let rec euler st eps numFact limFact funFact = 
    match st with 
    |st when (1.0/(funFact numFact) > eps) && numFact<limFact -> euler (st + (1.0/(funFact numFact))) eps (numFact+1.0) limFact funFact 
    |st -> printfn "euler for div %d: %f" (int limFact) st
 
 
let rec factorial num = 
    match num with 
    |num when num>1.0 ->num*factorial(num-1.0) 
    |num -> 1.0 
 
let rec div num constNum  = 
    let eulerDiv = fun (x:float) -> euler 1.0 0.00001 1.0 num factorial
    match num with 
    |num when (int num) = 0 -> 0
    |num when (constNum%(int num)=0) -> (eulerDiv num);div (num-1.0) constNum
    |num -> div (num-1.0) constNum  
 
(*simple number*)
let rec sn n1 n2 funGCD =
    match n1 with
    |n1 when (funGCD n1 n2)=1 -> printfn "%d " n2;sn n1 (n2-1) funGCD
    |n1 when (funGCD n1 n2)<>1 -> sn n1 (n2-1) funGCD
    |n1 when n2=0 -> 0
 
 (*greatest common divisor- НОД*)
let rec gcd n1 n2 n3 = 
    match n3 with 
    |n3 when n1>0 && n2 >0 && n1>n2 -> gcd (n1%n2) n2 n3 
    |n3 when n1>0 && n2 >0 && n1<n2 -> gcd n1 (n2%n1) n3 
    |n3 -> n1+n2 
 
[<EntryPoint>] 
let main argv =  
    let divisorEuler = fun f (x:float) (y:int) -> (f x y) 
    let result = divisorEuler div 10.0 10; 
    let simNumGCD = fun g (x1:int) (y1:int) fungcd -> (g x1 y1 fungcd) 
    let result2 = simNumGCD sn 58 58
    0 // возвращение целочисленного кода выхода

[<EntryPoint>] 
let main argv =  
    let divisorEuler = fun f (x:float) (y:int) -> (f x y) 
    let result = divisorEuler div 10.0 10; 
    let simNumGCD = fun g (x1:int) (y1:int) fungcd -> (g x1 y1 fungcd) 
    let result = simNumGCD sn 5 5 gcd

let rec sn n1 n2 funGCD =
    match n2 with
    |n2 when ((funGCD n1 n2 0)=1)&&n2<>0 -> printfn "%d " n2; sn n1 (n2-1) funGCD
    |n2 when ((funGCD n1 n2 0)<>1) && n2<>0-> sn n1 (n2-1) funGCD
    |n2 -> n2