Search Results for ""

The Feit-Thompson conjecture asserts that there are no primes p and q for which (p^q-1)/(p-1) and (q^p-1)/(q-1) have a common factor. Parker noticed that if this were true, ...

The fibonomial coefficient (sometimes also called simply the Fibonacci coefficient) is defined by [m; k]_F=(F_mF_(m-1)...F_(m-k+1))/(F_1F_2...F_k), (1) where [m; 0]_F=1 and ...

A finitely presented group is a group with a finite number of generators and relations. A mathematical joke involving finitely presented groups is given by Renteln and Dundes ...

The quantum of a finite floating-point representation is the value of a unit in the last position of its significand. In general, the quantum is equal to the radix raised to ...

For any nonzero lambda in C, either 1. The equation Tv-lambdav=0 has a nonzero solution v, or 2. The equation Tv-lambdav=f has a unique solution v for any function f. In the ...

An equation of the form f(x,y,...)=0, where f contains a finite number of independent variables, known functions, and unknown functions which are to be solved for. Many ...

Any symmetric polynomial (respectively, symmetric rational function) can be expressed as a polynomial (respectively, rational function) in the elementary symmetric ...

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 ...

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 ...

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...