Search Results for ""

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Durand's rule approximating the ...

The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...

A quantity defined for a conic section which can be given in terms of semimajor a and semiminor axes b. interval curve e e=0 circle 0 0<e<1 ellipse sqrt(1-(b^2)/(a^2)) e=1 ...

Given a set S of points in the plane, an enclosing circle is a circle for which all points S lie in its interior.

An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...

The bias of an estimator theta^~ is defined as B(theta^~)=<theta^~>-theta. (1) It is therefore true that theta^~-theta = (theta^~-<theta^~>)+(<theta^~>-theta) (2) = ...

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.

A non-Euclidean space with constant negative Gaussian curvature.

When a point P moves along a line through the circumcenter of a given triangle Delta, the pedal circle of P with respect to Delta passes through a fixed point (the Griffiths ...