Search Results for ""
6991 - 7000 of 13135 for Use of graphing calculatorsSearch Results
The maximum number of regions that can be created by n cuts using space division by planes, cube division by planes, cylinder cutting, etc., is given by N_(max)=1/6(n^3+5n+6) ...
Calabi's triangle is the unique triangle other that the equilateral triangle for which the largest inscribed square can be inscribed in three different ways (Calabi 1997). ...
A calibration form on a Riemannian manifold M is a differential p-form phi such that 1. phi is a closed form. 2. The comass of phi, sup_(v in ^ ^pTM, |v|=1)|phi(v)| (1) ...
Letting Lk be the linking number of the two components of a ribbon, Tw be the twist, and Wr be the writhe, then Lk(K)=Tw(K)+Wr(K). (Adams 1994, p. 187).
A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...
Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...
A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...
A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...
A theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...
The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.
...
View search results from all Wolfram sites (105888 matches)

