Search Results for ""

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

The nth taxicab number Ta(n) is the smallest number representable in n ways as a sum of positive cubes. The numbers derive their name from the Hardy-Ramanujan number Ta(2) = ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

The summatory function Phi(n) of the totient function phi(n) is defined by Phi(n) = sum_(k=1)^(n)phi(k) (1) = sum_(m=1)^(n)msum_(d|m)(mu(d))/d (2) = ...

The geometric centroid (center of mass) of the polygon vertices of a triangle is the point G (sometimes also denoted M) which is also the intersection of the triangle's three ...

A zerofree number n is called right truncatable if n and all numbers obtained by successively removing the rightmost digits are prime. There are exactly 83 right truncatable ...

Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...

A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...