TOPICS
Search

Search Results for ""


211 - 220 of 1033 for Largest small octagonSearch Results
7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...
The Engel polyhedra are two 38-faced plesiohedra (and hence space-filling) discovered by Engel (Engel 1981; Engel 1986, p. 220; Grünbaum and Shephard 1980; Senechal 1990, ...
Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...
The Flint Hills series is the series S_1=sum_(n=1)^infty(csc^2n)/(n^3) (Pickover 2002, p. 59). It is not known if this series converges, since csc^2n can have sporadic large ...
A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...
What is the largest number of subcubes (not necessarily different) into which a cube cannot be divided by plane cuts? The answer is 47 (Gardner 1992, pp. 297-298). The ...
The continued fraction for K is [2; 1, 2, 5, 1, 1, 2, 1, 1, ...] (OEIS A002211). A plot of the first 256 terms of the continued fraction represented as a sequence of binary ...
A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...
A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...
The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...
1 ... 19|20|21|22|23|24|25 ... 104 Previous Next

...