Search Results for ""
771 - 780 of 1833 for Disk covering problemSearch Results
A d-dimensional discrete percolation model on a regular point lattice L=L^d is said to be oriented if L is an oriented lattice. One common such model takes place on the ...
Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...
Given a regular tetrahedron of unit volume, consider the lengths of line segments connecting pairs of points picked at random inside the tetrahedron. The distribution of ...
Given a triangle with one vertex at the origin and the others at positions v_1 and v_2, one might think that a random point inside the triangle would be given by ...
To find the motion of a rectangular membrane with sides of length L_x and L_y (in the absence of gravity), use the two-dimensional wave equation ...
The term Mandelbrot set is used to refer both to a general class of fractal sets and to a particular instance of such a set. In general, a Mandelbrot set marks the set of ...
The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...
Two distinct theorems are referred to as "the de Bruijn-Erdős theorem." One of them (de Bruijn and Erdős 1951) concerns the chromatic number of infinite graphs; the other (de ...
A composite number n is a positive integer n>1 which is not prime (i.e., which has factors other than 1 and itself). The first few composite numbers (sometimes called ...
As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...
...
View search results from all Wolfram sites (161691 matches)

