Search Results for ""

The quotient W(p)=((p-1)!+1)/p which must be congruent to 0 (mod p) for p to be a Wilson prime. The quotient is an integer only when p=1 (in which case W(1)=2) or p is a ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

Conditions arising in the study of the Robbins axiom and its connection with Boolean algebra. Winkler studied Boolean conditions (such as idempotence or existence of a zero) ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

If y has period 2pi, y^' is L^2, and int_0^(2pi)ydx=0, (1) then int_0^(2pi)y^2dx<int_0^(2pi)y^('2)dx (2) unless y=Acosx+Bsinx (3) (Hardy et al. 1988). Another inequality ...

If X_i for i=1, ..., m has a multivariate normal distribution with mean vector mu=0 and covariance matrix Sigma, and X denotes the m×p matrix composed of the row vectors X_i, ...

For a connection A and a positive spinor phi in Gamma(V_+), Witten's equations (also called the Seiberg-Witten invariants) are given by D_Aphi = 0 (1) F_+^A = ...

A single axiom that is satisfied only by NAND or NOR must be of the form "something equals a," since otherwise constant functions would satisfy the equation. With up to six ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

A prize of 100000 German marks offered for the first valid proof of Fermat's last theorem (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199). The ...