Search Results for ""
211 - 220 of 259 for Evolutionary ProgrammingSearch Results
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 ...
The prime spiral, also known as Ulam's spiral, is a plot in which the positive integers are arranged in a spiral (left figure), with primes indicated in some way along the ...
A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...
secz is the trigonometric function defined by secz = 1/(cosz) (1) = 2/(e^(iz)+e^(-iz)), (2) where cosz is the cosine. The secant is implemented in the Wolfram Language as ...
To pick a random point on the surface of a unit sphere, it is incorrect to select spherical coordinates theta and phi from uniform distributions theta in [0,2pi) and phi in ...
The usual number of scalar operations (i.e., the total number of additions and multiplications) required to perform n×n matrix multiplication is M(n)=2n^3-n^2 (1) (i.e., n^3 ...
The base-3 method of counting in which only the digits 0, 1, and 2 are used. Ternary numbers arise in a number of problems in mathematics, including some problems of ...
A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...
A Turing machine which, by appropriate programming using a finite length of input tape, can act as any Turing machine whatsoever. In his seminal paper, Turing himself gave ...
...
View search results from all Wolfram sites (156676 matches)

