Search Results for ""
1181 - 1190 of 13135 for Combinatorial MathematicsSearch Results
2^(30)=1024^3=1073741824 bytes. Although the term gigabyte is sometimes used to refer to 1024^3 bytes, such usage is deprecated in favor of the standard SI naming convention ...
One billion (10^9) bytes. Unfortunately, the term is sometimes also used to mean 2^(30)=1024^3=1073741824 bytes. However, this usage is deprecated, and the term gibibyte is ...
A formula for numerical solution of differential equations, (1) where k_1 = hf(x_n,y_n) (2) k_2 = hf(x_n+1/2h,y_n+1/2k_1) (3) k_3 = ...
The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...
The Goffinet dragon is the fractal obtained by plotting all points spanned by powers of the complex number p=0.65-0.3i (Trott 2004, p. 9).
The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...
Regardless of where one white and one black square are deleted from an ordinary 8×8 chessboard, the reduced board can always be covered exactly with 31 dominoes (of dimension ...
A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...
The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...
An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...
...
View search results from all Wolfram sites (60124 matches)

