Search Results for ""
2701 - 2710 of 3197 for chess mathSearch Results

Hoggatt and Denman (1961) showed that any obtuse triangle can be divided into eight acute isosceles triangles. There are 1, 4, 23, 180, 1806, 20198, ... (OEIS A056814) ...
A median A_1M_1 of a triangle DeltaA_1A_2A_3 is the Cevian from one of its vertices A_1 to the midpoint M_1 of the opposite side. The three medians of any triangle are ...
Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...
Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...
In 1704, Sebastien Truchet considered all possible patterns formed by tilings of right triangles oriented at the four corners of a square (Wolfram 2002, p. 875). Truchet's ...
Roman (1984, p. 2) describes umbral calculus as the study of the class of Sheffer sequences. Umbral calculus provides a formalism for the systematic derivation and ...
The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...
A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

...