Search Results for ""

Discrete Mathematics

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

The integer sequence 1, 0, 1, 1, 2, 1, 3, 2, 4, 3, 5, 4, 7, 5, 8, 7, 10, 8, 12, 10, 14, 12, 16, 14, 19, 16, 21, 19, ... (OEIS A005044) given by the coefficients of the ...

An antisymmetric matrix, also known as a skew-symmetric or antimetric matrix, is a square matrix that satisfies the identity A=-A^(T) (1) where A^(T) is the matrix transpose. ...

The Bernoulli inequality states (1+x)^n>1+nx, (1) where x>-1!=0 is a real number and n>1 an integer. This inequality can be proven by taking a Maclaurin series of (1+x)^n, ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

The area of the shadow of a body on a plane, also called the "outer quermass."

A Cevian is a line segment which joins a vertex of a triangle with a point on the opposite side (or its extension). The condition for three general Cevians from the three ...

Apply Markov's inequality with a=k^2 to obtain P[(x-mu)^2>=k^2]<=(<(x-mu)^2>)/(k^2)=(sigma^2)/(k^2). (1) Therefore, if a random variable x has a finite mean mu and finite ...

An odd prime p is called a cluster prime if every even positive integer less than p-2 can be written as a difference of two primes q-q^', where q,q^'<=p. The first 23 odd ...