TOPICS
Search

Search Results for ""


4131 - 4140 of 6485 for Finite Group D 4Search Results
Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...
A kit consisting of colored rods and slotted balls that can be used to construct three-dimensional configurations. The balls into which the rods are placed resemble an ...
The method of d'Alembert provides a solution to the one-dimensional wave equation (partial^2y)/(partialx^2)=1/(c^2)(partial^2y)/(partialt^2) (1) that models vibrations of a ...
A q-analog of the gamma function defined by Gamma_q(x)=((q;q)_infty)/((q^x;q)_infty)(1-q)^(1-x), (1) where (x,q)_infty is a q-Pochhammer symbol (Koepf 1998, p. 26; Koekoek ...
Let there be n>=2 integers 0<a_1<...<a_n with GCD(a_1,a_2,...,a_n)=1. The values a_i represent the denominations of n different coins, where these denominations have greatest ...
Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...
A Heronian triangle is a triangle having rational side lengths and rational area. The triangles are so named because such triangles are related to Heron's formula ...
A quartic graph is a graph which is 4-regular. The unique quartic graph on five nodes is the complete graph K_5, and the unique quartic graph on six nodes is the octahedral ...
A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...
The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...
1 ... 411|412|413|414|415|416|417 ... 649 Previous Next

...