TOPICS
Search

Search Results for ""


691 - 700 of 789 for computer graphicsSearch Results
The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...
A magic tesseract is a four-dimensional generalization of the two-dimensional magic square and the three-dimensional magic cube. A magic tesseract has magic constant ...
Let a chess piece make a tour on an n×n chessboard whose squares are numbered from 1 to n^2 along the path of the chess piece. Then the tour is called a magic tour if the ...
The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...
Knuth (2008, p. 44) terms the 24-vertex graph based on the notes of the musical scale illustrated above the "musical graph." This graph can be seen to be the 24-vertex case ...
The Perkel graph is a weakly regular graph on 57 vertices and 171 edges, shown above in several embeddings. It is the unique distance-regular graph with intersection array ...
The Pochhammer symbol (x)_n = (Gamma(x+n))/(Gamma(x)) (1) = x(x+1)...(x+n-1) (2) (Abramowitz and Stegun 1972, p. 256; Spanier 1987; Koepf 1998, p. 5) for n>=0 is an ...
An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...
Find the m×n array of single digits which contains the maximum possible number of primes, where allowable primes may lie along any horizontal, vertical, or diagonal line. For ...
A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...
1 ... 67|68|69|70|71|72|73 ... 79 Previous Next

...