TOPICS
Search

Search Results for ""


11 - 20 of 209 for Inline 51Search Results
A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...
The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...
The small dodecahemidodecahedron is the uniform polyhedron with Maeder index 51 (Maeder 1997), Wenninger index 91 (Wenninger 1989), Coxeter index 65 (Coxeter et al. 1954), ...
The snub icosidodecadodecahedron is the uniform polyhedron with Maeder index 46 (Maeder 1997), Wenninger index 112 (Wenninger 1989), Coxeter index 58 (Coxeter et al. 1954), ...
A figurate number of the form StOct_n = O_n+8Te_(n-1) (1) = n(2n^2-1), (2) where O_n is an octahedral number and Te_n is a tetrahedral number. The first few are 1, 14, 51, ...
A Heronian tetrahedron, also called a perfect tetrahedron, is a (not necessarily regular) tetrahedron whose sides, face areas, and volume are all rational numbers. It ...
2023-08-30 The great ditrigonal icosidodecahedron is the uniform polyhedron with Maeder index 47 (Maeder 1997), Wenninger index 87 (Wenninger 1989), Coxeter index 58 (Coxeter ...
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 centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...
The circumference of a graph is the length of any longest cycle in a graph. Hamiltonian graphs on n>1 vertices therefore have circumference of n. For a cyclic graph, the ...
1|2|3|4|5 ... 21 Previous Next

...