Search Results for ""
1071 - 1080 of 2089 for Eulers Polygon Division ProblemSearch Results
A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...
As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...
Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...
There are many formulas of pi of many types. Among others, these include series, products, geometric constructions, limits, special values, and pi iterations. pi is ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...
The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
The curlicue fractal is a figure obtained by the following procedure. Let s be an irrational number. Begin with a line segment of unit length, which makes an angle phi_0=0 to ...
A convex polyomino containing at least one edge of its minimal bounding rectangle. The perimeter and area generating function for directed polygons of width m, height n, and ...
...
View search results from all Wolfram sites (162574 matches)

