Search Results for ""

Given a triangle, draw a Cevian to one of the bases that divides it into two triangles having congruent incircles. The positions and sizes of these two circumcircles can then ...

A prime factorization algorithm which uses residues produced in the continued fraction of sqrt(mN) for some suitably chosen m to obtain a square number. The algorithm solves ...

The cycle double cover conjecture states that every bridgeless graph has a collection of cycles which together contain every edge exactly twice. This conjecture remains open, ...

A hexagon (not necessarily regular) on whose polygon vertices a circle may be circumscribed. Let sigma_i=Pi_i(a_1^2,a_2^2,a_3^2,a_4^2,a_5^2,a_6^2) (1) denote the ith-order ...

A cyclic pentagon is a not necessarily regular pentagon on whose polygon vertices a circle may be circumscribed. Let such a pentagon have edge lengths a_1, ..., a_5, and area ...

Let A_1, A_2, A_3, and A_4 be four points on a circle, and H_1, H_2, H_3, H_4 the orthocenters of triangles DeltaA_2A_3A_4, etc. If, from the eight points, four with ...

Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

A statistical distribution whose variables can take on only discrete values. Abramowitz and Stegun (1972, p. 929) give a table of the parameters of most common discrete ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...