Search Results for ""

An analytic refinement of results from complex analysis such as those codified by Picard's little theorem, Picard's great theorem, and the Weierstrass-Casorati theorem.

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.

where del is the backward difference.

Let a triangle have side lengths a, b, and c with opposite angles A, B, and C. Then (b+c)/a = (cos[1/2(B-C)])/(sin(1/2A)) (1) (c+a)/b = (cos[1/2(C-A)])/(sin(1/2B)) (2) ...

If there exists a critical region C of size alpha and a nonnegative constant k such that (product_(i=1)^(n)f(x_i|theta_1))/(product_(i=1)^(n)f(x_i|theta_0))>=k for points in ...

Four bits or half a byte, also sometimes spelled "nybble." Since a nibble encodes values from 0 to 2^4-1=15, it can conveniently be represented using a single hexadecimal ...

A pile of counters in a game of nim. The nim-heap illustrated above corresponds to the game of Marienbad.

Let S_N(s)=sum_(n=1)^infty[(n^(1/N))]^(-s), (1) where [x] denotes nearest integer function, i.e., the integer closest to x. For s>3, S_2(s) = 2zeta(s-1) (2) S_3(s) = ...

A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.