Search Results for ""

Find the minimum size square capable of bounding n equal squares arranged in any configuration. The first few cases are illustrated above (Friedman). The only packings which ...

The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...

Stirling's approximation gives an approximate value for the factorial function n! or the gamma function Gamma(n) for n>>1. The approximation can most simply be derived for n ...

Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...

While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...

A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...

The tangential triangle is the triangle DeltaT_AT_BT_C formed by the lines tangent to the circumcircle of a given triangle DeltaABC at its vertices. It is therefore antipedal ...

The problem of finding the curve down which a bead placed anywhere will fall to the bottom in the same amount of time. The solution is a cycloid, a fact first discovered and ...

The area Delta (sometimes also denoted sigma) of a triangle DeltaABC with side lengths a, b, c and corresponding angles A, B, and C is given by Delta = 1/2bcsinA (1) = ...

The best known packings of equilateral triangles into an equilateral triangle are illustrated above for the first few cases (Friedman). The best known packings of equilateral ...