Search Results for ""

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

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

The quotient W(p)=((p-1)!+1)/p which must be congruent to 0 (mod p) for p to be a Wilson prime. The quotient is an integer only when p=1 (in which case W(1)=2) or p is a ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

Conditions arising in the study of the Robbins axiom and its connection with Boolean algebra. Winkler studied Boolean conditions (such as idempotence or existence of a zero) ...

If X_i for i=1, ..., m has a multivariate normal distribution with mean vector mu=0 and covariance matrix Sigma, and X denotes the m×p matrix composed of the row vectors X_i, ...

A single axiom that is satisfied only by NAND or NOR must be of the form "something equals a," since otherwise constant functions would satisfy the equation. With up to six ...

A prize of 100000 German marks offered for the first valid proof of Fermat's last theorem (Ball and Coxeter 1987, p. 72; Barner 1997; Hoffman 1998, pp. 193-194 and 199). The ...

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

A Woodall number is a number of the form W_n=2^nn-1. Woodall numbers are therefore similar to Mersenne numbers 2^n-1 but with an additional factor of n multiplying the power ...