Search Results for ""

A Tschirnhausen transformation can be used to take a general quintic equation to the form x^5-x-a=0, where a may be complex.

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

A system of equation types obtained by generalizing the differential equation for the normal distribution (dy)/(dx)=(y(m-x))/a, (1) which has solution y=Ce^((2m-x)x/(2a)), ...

The cube-octahedron compound is a polyhedron compound composed of a cube and its dual polyhedron, the octahedron. It is implemented in the Wolfram Language as ...

The base 2 method of counting in which only the digits 0 and 1 are used. In this base, the number 1011 equals 1·2^0+1·2^1+0·2^2+1·2^3=11. This base is used in computers, ...

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

In an additive group G, the additive inverse of an element a is the element a^' such that a+a^'=a^'+a=0, where 0 is the additive identity of G. Usually, the additive inverse ...

The Heisenberg group H^n in n complex variables is the group of all (z,t) with z in C^n and t in R having multiplication (w,t)(z,t^')=(w+z,t+t^'+I[w^*z]) (1) where w^* is the ...