Search Results for ""

For any M, there exists a t^' such that the sequence n^2+t^', where n=1, 2, ... contains at least M primes.

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

Willans' formula is a prime-generating formula due to Willan (1964) that is defined as follows. Let F(j) = |_cos^2[pi((j-1)!+1)/j]_| (1) = {1 for j=1 or j prime; 0 otherwise ...

Every even number is the difference of two consecutive primes in infinitely many ways (Dickson 2005, p. 424). If true, taking the difference 2, this conjecture implies that ...

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