Search Results for ""

Vardi's integral is the beautiful definite integral int_(pi/4)^(pi/2)lnlntanxdx = pi/2ln[sqrt(2pi)(Gamma(3/4))/(Gamma(1/4))] (1) = pi/4ln[(4pi^3)/(Gamma^4(1/4))] (2) = ...

A positive integer n is a veryprime iff all primes p<=sqrt(n) satisfy {|2[n (mod p)]-p|<=1 very strong; |2[n (mod p)]-p|<=sqrt(p) strong; |2[n (mod p)]-p|<=p/2 weak. (1) The ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

Let X_1, ..., X_N be a sequence of independent observations of a random variable X, and let the number of observations N itself be chosen at random. Then Wald's equation ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

Wallis's constant is the real solution (x^3-2x-5)_1=2.0945514815... (OEIS A007493) to the cubic equation x^3-2x-5=0. It was solved by Wallis to illustrate Newton's method for ...

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...