Search Results for ""

The Kaprekar routine is an algorithm discovered in 1949 by D. R. Kaprekar for 4-digit numbers, but which can be generalized to k-digit numbers. To apply the Kaprekar routine ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

Given three noncollinear points, construct three tangent circles such that one is centered at each point and the circles are pairwise tangent to one another. Then there exist ...

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

The smallest composite squarefree number (2·3), and the third triangular number (3(3+1)/2). It is the also smallest perfect number, since 6=1+2+3. The number 6 arises in ...

The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...

The point of concurrence of the joins of the vertices of a triangle and the points of contact of an inconic of the triangle (Veblen and Young 1938, p. 111; Eddy and Fritsch ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...