TOPICS
Search

Search Results for ""


10731 - 10740 of 13135 for Computational GeometrySearch Results
One of the numbers 1, 2, 3, ... (OEIS A000027), also called the counting numbers or natural numbers. 0 is sometimes included in the list of "whole" numbers (Bourbaki 1968, ...
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 ...
A continuous-time stochastic process W(t) for t>=0 with W(0)=0 and such that the increment W(t)-W(s) is Gaussian with mean 0 and variance t-s for any 0<=s<t, and increments ...
The Wiener sausage of radius a>0 is the random process defined by W^a(t)= union _(0<=s<=t)B_a(beta(s)) where here, beta(t) is the standard Brownian motion in R^d for t>=0 and ...
A nonparametric alternative to the paired t-test which is similar to the Fisher sign test. This test assumes that there is information in the magnitudes of the differences ...
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 ...
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 ...

...