Search Results for ""

A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...

A method for numerical solution of a second-order ordinary differential equation y^('')=f(x,y) first expounded by Gauss. It proceeds by introducing a function delta^(-2)f ...

A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...

Gaussian brackets are notation published by Gauss in Disquisitiones Arithmeticae and defined by [ ]=1 (1) [a_1]=a_1 (2) [a_1,a_2]=[a_1]a_2+[ ] (3) ...

Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...

Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...

Let a spherical triangle have sides a, b, and c with A, B, and C the corresponding opposite angles. Then (sin[1/2(a-b)])/(sin(1/2c)) = (sin[1/2(A-B)])/(cos(1/2C)) (1) ...