TOPICS
Search

Search Results for ""


1711 - 1720 of 4154 for Divide whole numbers and integersSearch Results
A solitaire game played with cards. The chance of winning is 1/13, and the arithmetic mean of the number of cards turned up is 42.4.
Given an arithmetic series {a_1,a_1+d,a_1+2d,...}, the number d is called the common difference associated to the sequence.
Given a geometric sequence {a_1,a_1r,a_1r^2,...}, the number r is called the common ratio associated to the sequence.
A compact surface is a surface which is also a compact set. A compact surface has a triangulation with a finite number of triangles. The sphere and torus are compact.
The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...
The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...
A method of determining the maximum number of positive and negative real roots of a polynomial. For positive roots, start with the sign of the coefficient of the lowest (or ...
The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.
A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].
If an infinite number of points in the plane are all separated by integer distances, then all the points lie on a straight line.
1 ... 169|170|171|172|173|174|175 ... 416 Previous Next

...