Search Results for ""

The Parry point is one of the two intersections of the Parry circle and the circumcircle of a triangle (the other is the focus of the Kiepert parabola, which is Kimberling ...

Let L, M, and N be lines through A, B, C, respectively, parallel to the Euler line. Let L^' be the reflection of L in sideline BC, let M^' be the reflection of M in sideline ...

If a function has a Fourier series given by f(x)=1/2a_0+sum_(n=1)^inftya_ncos(nx)+sum_(n=1)^inftyb_nsin(nx), (1) then Bessel's inequality becomes an equality known as ...

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

A rational function P(x)/Q(x) can be rewritten using what is known as partial fraction decomposition. This procedure often allows integration to be performed on each term ...

In a normal n×n Latin square, the entries in each row and column are chosen from a "global" set of n objects. Like a Latin square, a partial Latin square has no two rows or ...

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...