Search Results for ""

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...

In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...

The complexity c_n of an integer n is the least number of 1s needed to represent it using only additions, multiplications, and parentheses. For example, the numbers 1 through ...

Using the notation of Byerly (1959, pp. 252-253), Laplace's equation can be reduced to (1) where alpha = cint_c^lambda(dlambda)/(sqrt((lambda^2-b^2)(lambda^2-c^2))) (2) = ...

The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...

Mathematics is a broad-ranging field of study in which the properties and interactions of idealized objects are examined. Whereas mathematics began merely as a calculational ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

Newton's iteration is an algorithm for computing the square root sqrt(n) of a number n via the recurrence equation x_(k+1)=1/2(x_k+n/(x_k)), (1) where x_0=1. This recurrence ...

A connective in logic which yields true if any one of a sequence conditions is true, and false if all conditions are false. In formal logic, the term disjunction (or, more ...