Search Results for ""

The binomial distribution gives the discrete probability distribution P_p(n|N) of obtaining exactly n successes out of N Bernoulli trials (where the result of each Bernoulli ...

The number obtained by adding the reciprocals of the odd twin primes, B=(1/3+1/5)+(1/5+1/7)+(1/(11)+1/(13))+(1/(17)+1/(19))+.... (1) By Brun's theorem, the series converges ...

The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order of a group may be ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

Complex analysis is the study of complex numbers together with their derivatives, manipulation, and other properties. Complex analysis is an extremely powerful tool with an ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

A number of closed-form constants can be obtained for generalized continued fractions having particularly simple partial numerators and denominators. The Ramanujan continued ...

The cosine function cosx is one of the basic functions encountered in trigonometry (the others being the cosecant, cotangent, secant, sine, and tangent). Let theta be an ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...