Search Results for ""

Given a point with trilinear coordinates P=alpha:beta:gamma, the anticevian triangle DeltaA^'B^'C^' of a triangle DeltaABC with respect to P is a triangle such that 1. B^'C^' ...

Given triangle DeltaA_1A_2A_3, let the point of intersection of A_2Omega and A_3Omega^' be B_1, where Omega and Omega^' are the Brocard points, and similarly define B_2 and ...

A set in R^n which can be reduced to one of its points, say P, by a continuous deformation, is said to be contractible. The transformation is such that each point of the set ...

Points, also called polar reciprocals, which are transformed into each other through inversion about a given inversion circle C (or inversion sphere). The points P and P^' ...

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The 8.1.2 equation A^8+B^8=C^8 (1) is a special case of Fermat's last theorem with n=8, and so has no solution. No 8.1.3, 8.1.4, 8.1.5, 8.1.6, or 8.1.7 solutions are known. ...

Euclid's second theorem states that the number of primes is infinite. The proof of this can be accomplished using the numbers E_n = 1+product_(i=1)^(n)p_i (1) = 1+p_n#, (2) ...

The inverse of a square matrix A, sometimes called a reciprocal matrix, is a matrix A^(-1) such that AA^(-1)=I, (1) where I is the identity matrix. Courant and Hilbert (1989, ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...