Search Results for ""

A truncated polyhedron is a polyhedron with truncated faces, given by the Schläfli symbol t{p; q}. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...

Truncation is the removal of portions of solids falling outside a set of symmetrically placed planes. The operation implemented as Truncate[polyhedron, r] in the Wolfram ...

Let K be a number field, then each fractional ideal I of K belongs to an equivalence class [I] consisting of all fractional ideals J satisfying I=alphaJ for some nonzero ...

The first few terms in the continued fraction of the Champernowne constant are [0; 8, 9, 1, 149083, 1, 1, 1, 4, 1, 1, 1, 3, 4, 1, 1, 1, 15, 45754...10987, 6, 1, 1, 21, ...] ...

The simple continued fraction of the Euler-Mascheroni constant gamma is [0; 1, 1, 2, 1, 2, 1, 4, 3, 13, 5, 1, 1, 8, 1, 2, 4, 1, 1, 40, ...] (OEIS A002852). The first few ...

The continued fraction for ln10 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). The Engel expansion is 2, 3, 7, 9, 104, 510, 1413, ... (OEIS ...

The continued fraction for ln2 is [0; 1, 2, 3, 1, 6, 3, 1, 1, 2, 1, 1, 1, 1, 3, 10, ...] (OEIS A016730). It has been computed to 9702699208 terms by E. Weisstein (Aug. 21, ...

The simple continued fraction for pi is given by [3; 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, ...] (OEIS A001203). A plot of the first 256 terms of the ...

The characteristic function f(n)={1 n is prime; 0 n otherwise (1) of primes has values 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, ... (OEIS A010051) for n=1, 2, ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...