Search Results for ""

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

Let DeltaH_AH_BH_C be the orthic triangle of a triangle DeltaABC. Then each side of each triangle meets the three sides of the other triangle, and the points of intersection ...

The trilinear pole of the orthotransversal of a point P is called its orthocorrespondent. The orthocorrespondent of a point P=p:q:r is given by where S_A, S_B, and S_C is ...

Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...

For every dimension n>0, the orthogonal group O(n) is the group of n×n orthogonal matrices. These matrices form a group because they are closed under multiplication and ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

A statement which appears self-contradictory or contrary to expectations, also known as an antinomy. Curry (1977, p. 5) uses the term pseudoparadox to describe an apparent ...

Given any straight line and a point not on it, there "exists one and only one straight line which passes" through that point and never intersects the first line, no matter ...