Search Results for ""
1611 - 1620 of 1627 for Modulo Multiplication GroupSearch Results
The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...
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 ...
A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...
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 ...
The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...
A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...
An ellipse is a curve that is the locus of all points in the plane the sum of whose distances r_1 and r_2 from two fixed points F_1 and F_2 (the foci) separated by a distance ...
The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...
A problem is an exercise whose solution is desired. Mathematical "problems" may therefore range from simple puzzles to examination and contest problems to propositions whose ...
The regular dodecahedron, often simply called "the" dodecahedron, is the Platonic solid composed of 20 polyhedron vertices, 30 polyhedron edges, and 12 pentagonal faces, ...
...
View search results from all Wolfram sites (19877 matches)

