TOPICS
Search

Search Results for ""


1031 - 1040 of 1049 for Least Common MultipleSearch Results
In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...
Triskaidekaphobia is the fear of 13, a number commonly associated with bad luck in Western culture. While fear of the number 13 can be traced back to medieval times, the word ...
The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...
Geometry
The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...
An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...
A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...
An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...
1 ... 101|102|103|104|105 Previous Next

...