TOPICS
Search

Search Results for ""


11281 - 11290 of 13135 for Simple probabilitySearch Results
There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...
A theorem giving a criterion for an origami construction to be flat. Kawasaki's theorem states that a given crease pattern can be folded to a flat origami iff all the ...
Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...
d sum OEIS 0 23.10344 A082839 1 16.17696 A082830 2 19.25735 A082831 3 20.56987 A082832 4 21.32746 A082833 5 21.83460 A082834 6 22.20559 A082835 7 22.49347 A082836 8 22.72636 ...
A the (first, or internal) Kenmotu point, also called the congruent squares point, is the triangle center constructed by inscribing three equal squares such that each square ...
Kepler's folium is a folium curve explored by Kepler in 1609 (Lawrence 1972, p. 151; Gray et al. 2006, p. 85). When used without qualification, the term "folium" sometimes ...
C. Kimberling has extensively tabulated and enumerated the properties of triangle centers (Kimberling 1994, 1998, and online), denoting the nth center in his numbering scheme ...
The 60 Pascal lines of a hexagon inscribed in a conic intersect three at a time through 20 Steiner points, and also three at a time in 60 points known as Kirkman points. Each ...
A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...
Klee's identity is the binomial sum sum_(k=0)^n(-1)^k(n; k)(n+k; m)=(-1)^n(n; m-n), where (n; k) is a binomial coefficient. For m=0, 1, ... and n=0, 1,..., the following ...

...