Search Results for ""

A graph is called cordial if it is possible to label its vertices with 0s and 1s so that when the edges are labeled with the difference of the labels at their endpoints, the ...

A double integral is a two-fold multiple integral. Examples of definite double integrals evaluating to simple constants include int_0^1int_0^1(dxdy)/(1-x^2y^2) = 1/8pi^2 (1) ...

Fubini's theorem, sometimes called Tonelli's theorem, establishes a connection between a multiple integral and a repeated one. If f(x,y) is continuous on the rectangular ...

MANOVA ("multiple analysis of variance") is a procedure for testing the equality of mean vectors of more than two populations. The technique is analogous to ANOVA for ...

A multivalued function, also known as a multiple-valued function (Knopp 1996, part 1 p. 103), is a "function" that assumes two or more distinct values in its range for at ...

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

A proper ideal I of a ring R is called semiprime if, whenever J^n subset I for an ideal J of R and some positive integer, then J subset I. In other words, the quotient ring ...

A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...

A double sum is a series having terms depending on two indices, sum_(i,j)b_(ij). (1) A finite double series can be written as a product of series ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...