Search Results for ""

A genetic algorithm is a class of adaptive stochastic optimization algorithms involving search and optimization. Genetic algorithms were first used by Holland (1975). The ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

Gibrat's distribution is a continuous distribution in which the logarithm of a variable x has a normal distribution, P(x)=1/(xsqrt(2pi))e^(-(lnx)^2/2), (1) defined over the ...

The identity PVint_(-infty)^inftyF(phi(x))dx=PVint_(-infty)^inftyF(x)dx (1) holds for any integrable function F(x) and phi(x) of the form ...

A figurate number of the form g_n=2n-1 giving the area of the square gnomon obtained by removing a square of side n-1 from a square of side n, g_n = n^2-(n-1)^2 (1) = 2n-1. ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

The Gregory series is a pi formula found by Gregory and Leibniz and obtained by plugging x=1 into the Leibniz series, pi/4=sum_(k=1)^infty((-1)^(k+1))/(2k-1)=1-1/3+1/5-... ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...

The half-Moses circle is defined as the circle having the same center as the Moses circle, i.e., the Brocard midpoint X_(39) but half its radius, i.e., R_H = ...