Search Results for ""

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

For |q|<1, the Rogers-Ramanujan identities are given by (Hardy 1999, pp. 13 and 90), sum_(n=0)^(infty)(q^(n^2))/((q)_n) = 1/(product_(n=1)^(infty)(1-q^(5n-4))(1-q^(5n-1))) ...

Take any positive integer of two digits or more, reverse the digits, and add to the original number. This is the operation of the reverse-then-add sequence. Now repeat the ...

A general n-gonal antiprism is a polyhedron consisting of identical top and bottom n-gonal faces whose periphery is bounded by a band of 2n triangles with alternating up-down ...

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

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

The cosine function cosx is one of the basic functions encountered in trigonometry (the others being the cosecant, cotangent, secant, sine, and tangent). Let theta be an ...

The most general form of "an" exponential function is a power-law function of the form f(x)=ab^(cx+d), (1) where a, c, and d are real numbers, b is a positive real number, ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

The Folkman graph is a semisymmetric graph that has the minimum possible number of nodes (20) (Skiena 1990, p. 186). It is implemented in the Wolfram Language as ...