Search Results for ""

Replacing the logistic equation (dx)/(dt)=rx(1-x) (1) with the quadratic recurrence equation x_(n+1)=rx_n(1-x_n), (2) where r (sometimes also denoted mu) is a positive ...

There are three types of boundary conditions commonly encountered in the solution of partial differential equations: 1. Dirichlet boundary conditions specify the value of the ...

An integral equation of the form phi(x)=f(x)+lambdaint_(-infty)^inftyK(x,t)phi(t)dt (1) phi(x)=1/(sqrt(2pi))int_(-infty)^infty(F(t)e^(-ixt)dt)/(1-sqrt(2pi)lambdaK(t)). (2) ...

A Bessel function of the second kind Y_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 703, eqn. 6.649.1), sometimes also denoted N_n(x) (e.g, Gradshteyn and Ryzhik 2000, p. 657, ...

Given an arbitrary planar quadrilateral, place a square outwardly on each side, and connect the centers of opposite squares. Then van Aubel's theorem states that the two ...

The axiom of Zermelo-Fraenkel set theory which asserts the existence of a set containing all the natural numbers, exists x(emptyset in x ^ forall y in x(y^' in x)), where ...

The Bôcher Memorial Prize is awarded by the American Mathematical Society every five years for notable research in analysis that has appeared in a recognized North American ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

A two-dimensional binary (k=2) totalistic cellular automaton with a von Neumann neighborhood of range r=1. It has a birth rule that at least 2 of its 4 neighbors are alive, ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...