Search Results for ""

A graph is said to be H^*-connected if it is either Hamilton-connected or Hamilton-laceable. S. Wagon (pers. comm., May. 20, 2013; Dupuis and Wagon 2014) conjecture that all ...

With three cuts, dissect an equilateral triangle into a square. The problem was first proposed by Dudeney in 1902, and subsequently discussed in Dudeney (1958), and Gardner ...

Suppose a line L^' meets sidelines BC, CA, and AB in points A^', B^', and C^', respectively. Let A^('') be the reflection of A^' about the midpoint of segment BC, and ...

Since each triplet of Yff circles are congruent and pass through a single point, they obey Johnson's theorem. As a result, in each case, there is a fourth circle congruent to ...

The MacBeath circumconic is the dual conic to the MacBeath inconic, introduced in Dec. 2004 by P. Moses (Kimberling). It has circumconic parameters x:y:z=cosA:cosB:cosC, (1) ...

A maltitude ("midpoint altitude") is a perpendicular drawn to a side of a quadrilateral from the midpoint M_i of the opposite side. If the quadrilateral is cyclic, then the ...

The Napoleon-Feuerbach cubic is the pivotal isogonal cubic with nine-point center N as the pivot point. It therefore has trilinear equation ...

The Narayan number N(n,k) for n=1, 2, ... and k=1, ..., n gives a solution to several counting problems in combinatorics. For example, N(n,k) gives the number of expressions ...

The arc length of the parabolic segment y=h(1-(x^2)/(a^2)) (1) illustrated above is given by s = int_(-a)^asqrt(1+y^('2))dx (2) = 2int_0^asqrt(1+y^('2))dx (3) = ...

Three types of n×n matrices can be obtained by writing Pascal's triangle as a lower triangular matrix and truncating appropriately: a symmetric matrix S_n with (S)_(ij)=(i+j; ...