TOPICS
Search

Search Results for ""


541 - 550 of 3965 for Polynomial FunctionsSearch Results
If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then a^(lambda(n))=1 (mod n), where lambda is the Carmichael function.
sum_(k=-n)^n(-1)^k(n+b; n+k)(n+c; c+k)(b+c; b+k)=(Gamma(b+c+n+1))/(n!Gamma(b+1)Gamma(c+1)), where (n; k) is a binomial coefficient and Gamma(x) is a gamma function.
A function f(x) is logarithmically concave on the interval [a,b] if f>0 and lnf(x) is concave on [a,b]. The definition can also be extended to R^k->(0,infty) functions ...
For a real number x, the mantissa is defined as the positive fractional part x-|_x_|=frac(x), where |_x_| denotes the floor function. For example, for x=3.14159, the mantissa ...
A composition of a function f degreesf with itself gives a nested function f(f(x)), f degreesf degreesf which gives f(f(f(x)), etc. Function nesting is implemented in the ...
A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.
The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...
A completely monotonic function is a function f(x) such that (-1)^(-n)f^((n))(x)>=0 for n=0, 1, 2, .... Such functions occur in areas such as probability theory (Feller ...
For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...
The two-argument Ramanujan function is defined by phi(a,n) = 1+2sum_(k=1)^(n)1/((ak)^3-ak) (1) = 1-1/a(H_(-1/a)+H_(1/a)+2H_n-H_(n-1/a)-H_(n+1/a)). (2) The one-argument ...
1 ... 52|53|54|55|56|57|58 ... 397 Previous Next

...