Search Results for ""

The 4-polyhex illustrated above (Gardner 1978, p. 147).

Arnauld's paradox states that if negative numbers exist, then (-1)/1 must equal 1/(-1), which asserts that the ratio of a smaller to a larger quantity equals the ratio of the ...

In general, an arrangement of objects is simply a grouping of them. The number of "arrangements" of n items is given either by a combination (order is ignored) or permutation ...

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

A type of sale in which members of a group of buyers offer ever increasing amounts. The bidder making the last bid (for which no higher bid is subsequently made within a ...

"Aut" is the term applied in propositional calculus to the XOR connective. "Aut" is Latin form for "either/or (but not both)," e.g., "Aut Caesar aut nihil" (Cesare Borgia; ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...

A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...