TOPICS
Search

Search Results for ""


1951 - 1960 of 2089 for Eulers Polygon Division ProblemSearch Results
In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...
The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...
A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...
An abundant number, sometimes also called an excessive number, is a positive integer n for which s(n)=sigma(n)-n>n, (1) where sigma(n) is the divisor function and s(n) is the ...
If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...
The arithmetic-geometric mean agm(a,b) of two numbers a and b (often also written AGM(a,b) or M(a,b)) is defined by starting with a_0=a and b_0=b, then iterating a_(n+1) = ...
A 4-cusped hypocycloid which is sometimes also called a tetracuspid, cubocycloid, or paracycle. The parametric equations of the astroid can be obtained by plugging in n=a/b=4 ...
There are several different definitions of the barbell graph. Most commonly and in this work, the n-barbell graph is the simple graph obtained by connecting two copies of a ...
A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...
The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...
1 ... 193|194|195|196|197|198|199 ... 209 Previous Next

...