Search Results for ""
1971 - 1980 of 2910 for Integer complexitySearch Results
Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...
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) = ...
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 ...
A weakly perfect graph is a graph for which omega(G)=chi(G) (without any requirement that this condition also hold on induced subgraphs, which is required for a graph to be ...
A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...
The Weierstrass constant is defined as the value sigma(1|1,i)/2, where sigma(z|omega_1,omega_2) is the Weierstrass sigma function with half-periods omega_1 and omega_2. ...
Let any finite or infinite set of points having no finite limit point be prescribed, and associate with each of its points a definite positive integer as its order. Then ...
...
View search results from all Wolfram sites (340627 matches)

