Search Results for ""
251 - 260 of 369 for Diophantine ApproximationSearch Results
A piecewise linear function is a function composed of some number of linear segments defined over an equal number of intervals, usually of equal size. For example, consider ...
A conformal mapping from the upper half-plane to a polygon.
A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...
Let a and b be nonzero integers such that a^mb^n!=1 (except when m=n=0). Also let T(a,b) be the set of primes p for which p|(a^k-b) for some nonnegative integer k. Then ...
In the tabu search category of meta-heuristics, the essential idea is to 'forbid' search moves to points already visited in the (usually discrete) search space, at least for ...
The 2-point Newton-Cotes formula int_(x_1)^(x_2)f(x)dx=1/2h(f_1+f_2)-1/(12)h^3f^('')(xi), where f_i=f(x_i), h is the separation between the points, and xi is a point ...
Every convex body B in the Euclidean plane with area A can be inscribed in a triangle of area at most equal to 2A (Gross 1918, Eggleston 1957). The worst possible fit ...
A Pythagorean triple is a triple of positive integers a, b, and c such that a right triangle exists with legs a,b and hypotenuse c. By the Pythagorean theorem, this is ...
A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...
The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...
...
View search results from all Wolfram sites (5794 matches)

