Search Results for ""
5781 - 5790 of 13135 for science historySearch Results
The shoelace formula, also known as Gauss's area formula, the shoelace algorithm, shoelace method, or surveyor's formula, is a name sometimes given to the polygon area ...
The Japanese variant of the game of chess. Shogi is played on a 9×9 uncheckered board, and each player begins with 20 pieces: one king, one rook, one bishop, two gold ...
A knot used to shorten a long rope.
A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...
Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...
A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...
A method for constructing magic squares of odd order, also called de la Loubere's method.
A pair of dice which have the same odds for throwing every number as a normal pair of 6-sided dice. They are the only such alternate arrangement if face values are required ...
If a fixed fraction x of a given amount of money P is lost, and then the same fraction x of the remaining amount is gained, the result is less than the original and equal to ...
The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...
...
View search results from all Wolfram sites (203459 matches)

