Документация к Math.NET Symbolics

Polynomial.halfDiophantineGcd

1: 

val halfDiophantineGcd : symbol : Expression -> u : Expression -> v : Expression ->  Expression
CompiledName: halfDiophantineGcd

Описание

Returns a, such that

1: 

 a*u = w (mod v)

Пример

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

let print = Infix.format >> printfn "%s"

let u = "x^4 - 2*x^3 - 6*x^2 + 12*x + 15 " |> Infix.parseOrUndefined
let v = "x^3 + x^2 - 4*x - 4" |> Infix.parseOrUndefined
let w = "x^2 - 1" |> Infix.parseOrUndefined
let x = symbol "x"

let a = Polynomial.halfDiophantineGcd x u v w

printf "u: "
print u
printf "v: "
print v
printf "w: "
print v
printf "a: "
print a

Вывод

1: 
2: 
3: 
4: 

u: 15 + 12*x - 6*x^2 - 2*x^3 + x^4
v: -4 - 4*x + x^2 + x^3
w: -4 - 4*x + x^2 + x^3
a: -3/5 + (4/5)*x - (1/5)*x^2