Search Results for ""

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

Let f be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then if f(a)=f(b), then there is at least one point c in (a,b) where f^'(c)=0. ...

Russian roulette is a game of chance in which one or more of the six chambers of a revolver are filled with cartridges, the chamber is rotated at random, and the gun is ...

There are at least two theorems known as Salmon's theorem. This first states that if P and S are two points, PX and SY are the perpendiculars from P and S to the polars of S ...

Informally, the sample space for a given set of events is the set of all possible values the events may assume. Formally, the set of possible events for a given random ...

For d>=1, Omega an open subset of R^d, p in [1;+infty] and s in N, the Sobolev space W^(s,p)(R^d) is defined by W^(s,p)(Omega)={f in L^p(Omega): forall ...

The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...

In Minkowski space, a twistor may be defined as a pair consisting of a spinor field and a complex conjugate spinor field satisfying the twistor equation.

Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is the ...