TOPICS
Search

Search Results for ""


1291 - 1300 of 13135 for rational numberSearch Results
The term Nasik cube can refer to a number of different sorts of magic cubes. In particular, a Nasik cube is a magic cube in which additionally 1. The broken space diagonals ...
A number of fractal curves are associated with Peano. The Peano curve is the fractal curve illustrated above which can be written as a Lindenmayer system. The nth iteration ...
Consider n intersecting circles. The maximal number of regions into which these divide the plane are N(n)=n^2-n+2, giving values for n=1, 2, ... of 2, 4, 8, 14, 22, 32, 44, ...
On a three-dimensional lattice, a random walk has less than unity probability of reaching any point (including the starting point) as the number of steps approaches infinity. ...
Given two functions f and g analytic in A with gamma a simple loop homotopic to a point in A, if |g(z)|<|f(z)| for all z on gamma, then f and f+g have the same number of ...
The number of regions into which space can be divided by n mutually intersecting spheres is N=1/3n(n^2-3n+8), giving 2, 4, 8, 16, 30, 52, 84, ... (OEIS A046127) for n=1, 2, ...
A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...
With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...
A product space product_(i in I)X_i is compact iff X_i is compact for all i in I. In other words, the topological product of any number of compact spaces is compact. In ...
An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...
1 ... 127|128|129|130|131|132|133 ... 1314 Previous Next

...