TOPICS
Search

Search Results for ""


301 - 310 of 1033 for Largest small octagonSearch Results
A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...
A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...
The diminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(76). This solid is the diminished polyhedron obtained by diminishing a small ...
Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...
A point where a stable and an unstable separatrix (invariant manifold) from the same fixed point or same family intersect. Therefore, the limits lim_(k->infty)f^k(X) and ...
1000 The medial triambic icosahedron is the dual of the ditrigonal dodecadodecahedron U_(41) and Wenninger dual W_(80), whose outward appearance is the same as the great ...
A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...
The 60-faced dual polyhedron of the truncated dodecahedron A_(10) (Holden 1971, p. 55) and Wenninger dual W_(10). Wenninger (1989, p. 46) calls the small triambic icosahedron ...
The continued fraction for ln10 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). The Engel expansion is 2, 3, 7, 9, 104, 510, 1413, ... (OEIS ...
The continued fraction for ln2 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). It has been computed to 9702699208 terms by E. Weisstein (Aug. 21, ...
1 ... 28|29|30|31|32|33|34 ... 104 Previous Next

...