TOPICS
Search

Search Results for ""


441 - 450 of 1340 for Root Finding AlgorithmSearch Results
The first definition of the logarithm was constructed by Napier and popularized through his posthumous pamphlet (Napier 1619). It this pamphlet, Napier sought to reduce the ...
A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...
The logarithmic integral is defined as the Cauchy principal value li(x) = PVint_0^x(dt)/(lnt) (1) = ...
Rather surprisingly, trigonometric functions of npi/17 for n an integer can be expressed in terms of sums, products, and finite root extractions because 17 is a Fermat prime. ...
Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...
A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...
The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...
Ueberhuber (1997, p. 71) and Krommer and Ueberhuber (1998, pp. 49 and 155-165) use the word "quadrature" to mean numerical computation of a univariate integral, and ...
Differential algebra is a field of mathematics that attempts to use methods from abstract algebra to study solutions of systems of polynomial nonlinear ordinary and partial ...
Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...
1 ... 42|43|44|45|46|47|48 ... 134 Previous Next

...