TOPICS
Search

Search Results for ""


11051 - 11060 of 13135 for Discrete groupSearch Results
A polygon which has both a circumcircle (which touches each vertex) and an incircle (which is tangent to each side). All triangles are bicentric with R^2-x^2=2Rr, (1) where R ...
A bicentric quadrilateral, also called a cyclic-inscriptable quadrilateral, is a four-sided bicentric polygon. The inradius r, circumradius R, and offset x are connected by ...
In a dynamical system, a bifurcation is a period doubling, quadrupling, etc., that accompanies the onset of chaos. It represents the sudden appearance of a qualitatively ...
The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...
Bilinski (1960) noted that by collapsing any one of the five zones of the rhombic icosahedron, a second rhombic dodecahedron distinct from the dual polyhedron of the ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...
The Blancmange function, also called the Takagi fractal curve (Peitgen and Saupe 1988), is a pathological continuous function which is nowhere differentiable. Its name ...

...