Search Results for ""

A pair of closed form functions (F,G) is said to be a Wilf-Zeilberger pair if F(n+1,k)-F(n,k)=G(n,k+1)-G(n,k). (1) The Wilf-Zeilberger formalism provides succinct proofs of ...

Iff p is a prime, then (p-1)!+1 is a multiple of p, that is (p-1)!=-1 (mod p). (1) This theorem was proposed by John Wilson and published by Waring (1770), although it was ...

The Wong graph is one of the four (5,5)-cage graphs. Like the other (5,5)-cages, the Wong graph has 30 nodes. It has 75 edges, girth 5, diameter 3, chromatic number 4, and is ...

Wyler's constant is defined as alpha_W = 9/(8pi^4)((pi^5)/(2^4·5!))^(1/4) (1) = 0.0072973... (2) = 1/(137.0360824...) (3) (Wyler 1969, 1971; OEIS A180872 and A180873), which ...

A connective in logic known as the "exclusive or," or exclusive disjunction. It yields true if exactly one (but not both) of two conditions is true. The XOR operation does ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

A zebra graph is a graph formed by all possible moves of a hypothetical chess piece called a "zebra" which moves analogously to a knight except that it is restricted to moves ...

Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) (1) is the multinomial coefficient ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...