Search Results for ""

A method for constructing magic squares of odd order, also called the Siamese method.

The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...

The circle method is a method employed by Hardy, Ramanujan, and Littlewood to solve many asymptotic problems in additive number theory, particularly in deriving an asymptotic ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

The derivative (deltaL)/(deltaq)=(partialL)/(partialq)-d/(dt)((partialL)/(partialq^.)) appearing in the Euler-Lagrange differential equation.

The method for solving the Goursat problem and Cauchy problem for linear hyperbolic partial differential equations using a Riemann function.