Search Results for ""

Let {a_n} be a series of positive terms with a_(n+1)<=a_n. Then sum_(n=1)^(infty)a_n converges iff sum_(k=0)^infty2^ka_(2^k) converges.

D = f_(xx)f_(yy)-f_(xy)f_(yx) (1) = f_(xx)f_(yy)-f_(xy)^2, (2) where f_(ij) are partial derivatives.

A test to determine if a given series converges or diverges.

Let {u_n(x)} be a sequence of functions. If 1. u_n(x) can be written u_n(x)=a_nf_n(x), 2. suma_n is convergent, 3. f_n(x) is a monotonic decreasing sequence (i.e., ...

A robust estimation based on a rank test.

Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...

The probability that a statistical test will be positive for a true statistic.

The probability that a statistical test will be negative for a negative statistic.

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...