Search Results for ""

The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...

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, ...

Given a circle expressed in trilinear coordinates by a central circle is a circle such that l:m:n is a triangle center and k is a homogeneous function that is symmetric in ...

The cubic formula is the closed-form solution for a cubic equation, i.e., the roots of a cubic polynomial. A general cubic equation is of the form z^3+a_2z^2+a_1z+a_0=0 (1) ...

The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...

If p is a prime number and a is a natural number, then a^p=a (mod p). (1) Furthermore, if pa (p does not divide a), then there exists some smallest exponent d such that ...

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

In 1611, Kepler proposed that close packing (either cubic or hexagonal close packing, both of which have maximum densities of pi/(3sqrt(2)) approx 74.048%) is the densest ...

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

In this work, the name Pythagoras's constant will be given to the square root of 2, sqrt(2)=1.4142135623... (1) (OEIS A002193), which the Pythagoreans proved to be ...