Search Results for ""

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

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 orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...

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

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

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Woolhouse's formulas ...

Let points A^', B^', and C^' be marked off some fixed distance x along each of the sides BC, CA, and AB. Then the lines AA^', BB^', and CC^' concur in a point U known as the ...

The Zeckendorf representation of a positive integer n is a representation of n as a sum of nonconsecutive distinct Fibonacci numbers, n=sum_(k=2)^Lepsilon_kF_k, where ...