Search Results for ""

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

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 Delta have angles A, B, and C. Then the spherical excess is given by Delta=A+B+C-pi.

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...

The assignment of labels or colors to the edges or vertices of a graph. The most common types of graph colorings are edge coloring and vertex coloring.

An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Only connected, bridgeless graphs can have a strong orientation ...

Poisson's equation is del ^2phi=4pirho, (1) where phi is often called a potential function and rho a density function, so the differential operator in this case is L^~=del ...

An equation derived by Kronecker: where r(n) is the sum of squares function, zeta(z) is the Riemann zeta function, eta(z) is the Dirichlet eta function, Gamma(z) is the gamma ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...