return bool |
|
object obj |
Type Fn
Namespace MathNet.Numerics
return bool |
|
object obj |
return int |
return Type |
return string |
return double |
|
double z |
|
double w |
return double |
|
double z |
|
double w |
return double |
|
double a |
|
double b |
|
double x |
If you need to multiply or divide various such coefficients, consider using the logarithmic version BinomialCoefficientLn instead so you can add instead of multiply and subtract instead of divide, and then exponentiate the result using Exp.
return double |
|
int n |
|
int k |
return double |
|
int n |
|
int k |
return int |
|
int value |
return double |
|
double x |
return double |
|
double x |
return double |
|
double x |
If you need to multiply or divide various such factorials, consider using the logarithmic version FactorialLn instead so you can add instead of multiply and subtract instead of divide, and then exponentiate the result using Exp. This will also completely circumvent the problem that factorials easily become very large.
return double |
|
int value |
return double |
|
int value |
return int |
|
int value |
return double |
|
double value |
return double |
|
double value |
return double |
|
double a |
|
double x |
return long |
|
long a |
|
long b |
|
Int64& x |
|
Int64& y |
return long |
|
long a |
|
long b |
See Wikipedia - Harmonic Number
return double |
|
int n |
n >= 0 |
sqrt(a2 + b2)
without underflow/overflow.
return double |
|
double a |
|
double b |
return double |
|
double a |
|
double b |
|
double x |
return double |
|
double a |
|
double x |
return int |
|
int x |
return long |
|
long radix |
|
uint exponent |
return int |
|
int exponent |
return long |
|
long a |
|
long b |
sinc(x) = sin(pi * x) / (pi * x)
return double |
|
double x |