Search Results for ""
2931 - 2940 of 3930 for Regularized Beta FunctionSearch Results

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...
Carmichael's conjecture asserts that there are an infinite number of Carmichael numbers. This was proven by Alford et al. (1994).
A fractal-like structure is produced for x<0 by superposing plots of Carotid-Kundalini functions ck_n of different orders n. the region -1<x<0 is called fractal land by ...
Given a symmetric positive definite matrix A, the Cholesky decomposition is an upper triangular matrix U with strictly positive diagonal entries such that A=U^(T)U. Cholesky ...
A complex number may be taken to the power of another complex number. In particular, complex exponentiation satisfies (a+bi)^(c+di)=(a^2+b^2)^((c+id)/2)e^(i(c+id)arg(a+ib)), ...
The science of adversarial information protection.
A number is said to be cubefree if its prime factorization contains no tripled factors. All primes are therefore trivially cubefree. The cubefree numbers are 1, 2, 3, 4, 5, ...
A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...
A delay differential equation (also called a differential delay equation or difference-differential equation, although the latter term has a different meaning in the modern ...
The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

...