Search Results for ""
8371 - 8380 of 13135 for sun rotationSearch Results
![](/common/images/search/spacer.gif)
The pentagrammic prism is the self-intersecting uniform polyhedron with Maeder index 78 (Maeder 1997), Coxeter index 33 (Coxeter et al. 1954), and Har'El index 3 (Har'El ...
A polyhedral graph on five nodes. There are two topologically distinct pentahedral graphs which, through duality, correspond to the skeletons of the square pyramid (left ...
The pentakis dodecahedron is the 60-faced dual polyhedron of the truncated icosahedron A_(11) (Holden 1971, p. 55). It is Wenninger dual W_9. It can be constructed by ...
The pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...
A multimagic square such that the first, second, third, fourth, and fifth powers of the elements all yield magic squares is known as a pentamagic square. The first known ...
The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...
The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...
A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...
Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...
The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...
![](/common/images/search/spacer.gif)
...