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 ...

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 ...

All the propositions in projective geometry occur in dual pairs which have the property that, starting from either proposition of a pair, the other can be immediately ...

The set of terms of first-order logic (also known as first-order predicate calculus) is defined by the following rules: 1. A variable is a term. 2. If f is an n-place ...

Calculus I

A run is a sequence of more than one consecutive identical outcomes, also known as a clump. Let R_p(r,n) be the probability that a run of r or more consecutive heads appears ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

An arithmetic progression, also known as an arithmetic sequence, is a sequence of n numbers {a_0+kd}_(k=0)^(n-1) such that the differences between successive terms is a ...

A transformation in which coordinates in two spaces are expressed rationally in terms of those in another.

Erdős proved that there exist at least one prime of the form 4k+1 and at least one prime of the form 4k+3 between n and 2n for all n>6.