Search Results for ""
261 - 270 of 937 for Cantor Diagonal MethodSearch Results
An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...
A method for verifying the correctness of an arithmetical operation on natural numbers, based on the same principle as casting out nines. The methods of sevens takes ...
Chió pivotal condensation is a method for evaluating an n×n determinant in terms of (n-1)×(n-1) determinants. It also leads to some remarkable determinant identities (Eves ...
An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...
Erdős and Heilbronn (Erdős and Graham 1980) posed the problem of estimating from below the number of sums a+b where a in A and b in B range over given sets A,B subset= Z/pZ ...
A method for finding a matrix inverse. To apply Gauss-Jordan elimination, operate on a matrix [A I]=[a_(11) ... a_(1n) 1 0 ... 0; a_(21) ... a_(2n) 0 1 ... 0; | ... | | | ... ...
This is sometimes knows as the "bars and stars" method. Suppose a recipe called for 5 pinches of spice, out of 9 spices. Each possibility is an arrangement of 5 spices ...
The second-order ordinary differential equation (d^2y)/(dx^2)-2x(dy)/(dx)+lambday=0. (1) This differential equation has an irregular singularity at infty. It can be solved ...
An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...
Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...
...
View search results from all Wolfram sites (19017 matches)

