TOPICS
Search

Search Results for ""


771 - 780 of 1340 for Root Finding AlgorithmSearch Results
The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...
The rhombic enneacontahedron is the equilateral zonohedron constructed from the 10 diameters of the dodecahedron. This enneacontahedron somewhat resembles a figure of Sharp ...
The so-called rule of three is an educational tool utilized historically to verbalize the process of solving basic linear equations with four terms where three of the terms ...
A four-sided quadrilateral not contained in a plane. The lines connecting the midpoints of opposite sides of a skew quadrilateral intersect (and bisect) each other (Steinhaus ...
A formula also known as the Legendre addition theorem which is derived by finding Green's functions for the spherical harmonic expansion and equating them to the generating ...
In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...
A graph H is called a topological minor, also known as a homeomorphic subgraph, of a graph G if a graph subdivision of H is isomorphic to a subgraph of G. Every topological ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...
The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...
1 ... 75|76|77|78|79|80|81 ... 134 Previous Next

...