Search Results for ""
4391 - 4400 of 13134 for complexity theorySearch Results
The Robbins constant is the mean line segment length, i.e., the expected distance between two points chosen at random in cube line picking, namely Delta(3) = (1) = (2) = ...
The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
If n>19, there exists a Poulet number between n and n^2. The theorem was proved in 1965.
Also called "Ethiopian multiplication." To multiply two numbers a and b, write a_0=a and b_0=b in two columns. Under a_0, write |_a_0/2_|, where |_x_| is the floor function, ...
Russian roulette is a game of chance in which one or more of the six chambers of a revolver are filled with cartridges, the chamber is rotated at random, and the gun is ...
Sarnak's constant is the constant C_(Sarnak) = product_(p>=3)(1-(p+2)/(p^3)) (1) = 0.7236484022... (2) (OEIS A065476), where the product is over the odd primes.
An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...
The second, or diamond, group isomorphism theorem, states that if G is a group with A,B subset= G, and A subset= N_G(B), then (A intersection B)⊴A and AB/B=A/A intersection ...
Consider a second-order differential operator L^~u(x)=p_0(d^2u)/(dx^2)+p_1(du)/(dx)+p_2u, (1) where u=u(x) and p_i=p_i(x) are real functions of x on the region of interest ...
...
View search results from all Wolfram sites (28442 matches)

