Search Results for ""
341 - 350 of 570 for ant algorithm pheromone trailSearch Results
The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...
A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...
A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...
The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...
The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...
The unknot, also called the trivial knot (Rolfsen 1976, p. 51), is a closed loop that is not knotted. In the 1930s Reidemeister first proved that knots exist which are ...
Discrete Mathematics
Ai(z) and Ai^'(z) have zeros on the negative real axis only. Bi(z) and Bi^'(z) have zeros on the negative real axis and in the sector pi/3<|argz|<pi/2. The nth (real) roots ...
Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...
The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...
...
View search results from all Wolfram sites (9379 matches)

