TOPICS
Search

Search Results for ""


51 - 60 of 2089 for Eulers Polygon Division ProblemSearch Results
Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...
A plot of the cumulative frequency against the upper class boundary with the points joined by line segments. Any continuous cumulative frequency curve, including a cumulative ...
The problem of determining (or counting) the set of all solutions to a given problem.
The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...
If a plane cuts the sides AB, BC, CD, and DA of a skew quadrilateral ABCD in points P, Q, R, and S, then (AP)/(PB)·(BQ)/(QC)·(CR)/(RD)·(DS)/(SA)=1 both in magnitude and sign ...
The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...
Consider n intersecting ellipses. The maximal number of regions into which these divide the plane are N(n)=2n^2-2n+2=2(n^2-n+1), giving values for n=1, 2, ... of 2, 6, 14, ...
A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...
A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...
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, ...
1 ... 3|4|5|6|7|8|9 ... 209 Previous Next

...