Search Results for ""

Every finite group G of order greater than one possesses a finite series of subgroups, called a composition series, such that I<|H_s<|...<|H_2<|H_1<|G, where H_(i+1) is a ...

The sequence generated by the Levine-O'Sullivan greedy algorithm: 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, ... (OEIS A014011). The reciprocal ...

A superabundant number is a composite number n such that sigma(n)/n>sigma(k)/k for all k<n, where sigma(n) is the divisor function. Superabundant numbers are closely related ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

A multiplication table is an array showing the result of applying a binary operator to elements of a given set S. For example, the following table is the multiplication table ...

The smallI icosicosidodecahedron is the uniform polyhedron with Maeder index 31 (Maeder 1997), Wenninger index 71 (Wenninger 1989), Coxeter index 40 (Coxeter et al. 1954), ...

R. Whorf found that there are probably several thousand stellations of the small triakis octahedron (Wenninger 1983, p. 36). In particular, the convex hulls of the great ...

The tetrahemihexahedron is the uniform polyhedron with Maeder index 4 (Maeder 1997), Wenninger index 67 (Wenninger 1989), Coxeter index 36 (Coxeter et al. 1954), and Har'El ...

Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...