Search Results for ""
4521 - 4530 of 13134 for complexity theorySearch Results
There are (at least) two mathematical objects known as Weierstrass forms. The first is a general form into which an elliptic curve over any field K can be transformed, given ...
A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...
The apodization function A(x)=1-(x^2)/(a^2). (1) Its full width at half maximum is sqrt(2)a. Its instrument function is I(k) = 2asqrt(2pi)(J_(3/2)(2pika))/((2pika)^(3/2)) (2) ...
A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
The White House switchboard constant is the name given by Munroe (2012) to the constant W = exp[-(1+8^(1/(e-1)))^(1/pi)] (1) = 0.202456141492... (2) (OEIS A182064), the first ...
There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...
Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...
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 ...
...
View search results from all Wolfram sites (28442 matches)

