Search Results for ""
451 - 460 of 504 for Gauss's inequalitySearch Results
The Reuleaux tetrahedron, sometimes also called the spherical tetrahedron, is the three-dimensional solid common to four spheres of equal radius placed so that the center of ...
Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...
The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...
The circumcenter is the center O of a triangle's circumcircle. It can be found as the intersection of the perpendicular bisectors. The trilinear coordinates of the ...
The Cartesian graph product G=G_1 square G_2, also called the graph box product and sometimes simply known as "the" graph product (Beineke and Wilson 2004, p. 104) and ...
The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...
The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...
The orchard-planting problem (also known as the orchard problem or tree-planting problem) asks that n trees be planted so that there will be r(n,k) straight rows with k trees ...
An ordinary double point of a plane curve is point where a curve intersects itself such that two branches of the curve have distinct tangent lines. Ordinary double points of ...
Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...
...


