Search Results for ""

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

A function H that maps an arbitrary length message M to a fixed length message digest MD is a collision-free hash function if 1. It is a one-way hash function. 2. It is hard ...

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

The subset C of the Euclidean plane formed by the union of the x-axis, the line segment with interval [0,1] of the y-axis, and the sequence of segments with endpoints (1/n,0) ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

The approximation of a piecewise monotonic function f by a polynomial with the same monotonicity. Such comonotonic approximations can always be accomplished with nth degree ...

The compact-open topology is a common topology used on function spaces. Suppose X and Y are topological spaces and C(X,Y) is the set of continuous maps from f:X->Y. The ...

If V and W are Banach spaces and T:V->W is a bounded linear operator, the T is said to be a compact operator if it maps the unit ball of V into a relatively compact subset of ...