Search Results for ""
181 - 190 of 914 for Perfect magic cubeSearch Results
The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...
Calculating the 13th root of a large number (that is a perfect 13th power) is a famous mental calculation challenge. However, because of difficulties in standardizing the ...
A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...
A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...
Let sigma_0(n) and sigma_1(n) denote the number and sum of the divisors of n, respectively (i.e., the zeroth- and first-order divisor functions). A number n is called sublime ...
A closed three-dimensional figure (which may, according to some terminology conventions, be self-intersecting). Kern and Bland (1948, p. 18) define a solid as any limited ...
The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...
The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).
For every topological T1-space X, the following conditions are equivalent. 1. X is regular and second countable, 2. X is separable and metrizable. 3. X is homeomorphic to a ...
A number n such that sigma^2(n)=sigma(sigma(n))=2n, where sigma(n) is the divisor function is called a superperfect number. Even superperfect numbers are just 2^(p-1), where ...
...
View search results from all Wolfram sites (4688 matches)

