Search Results for ""
1431 - 1440 of 2846 for Maximum Modulus TheoremSearch Results
![](/common/images/search/spacer.gif)
The geodesic on an oblate spheroid can be computed analytically, although the resulting expression is much more unwieldy than for a simple sphere. A spheroid with equatorial ...
The sequence of Fibonacci numbers {F_n} is periodic modulo any modulus m (Wall 1960), and the period (mod m) is the known as the Pisano period pi(m) (Wrench 1969). For m=1, ...
The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...
The nth root (or "nth radical") of a quantity z is a value r such that z=r^n, and therefore is the inverse function to the taking of a power. The nth root is denoted ...
In general, there are two important types of curvature: extrinsic curvature and intrinsic curvature. The extrinsic curvature of curves in two- and three-space was the first ...
The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...
An elliptic integral is an integral of the form int(A(x)+B(x)sqrt(S(x)))/(C(x)+D(x)sqrt(S(x)))dx, (1) or int(A(x)dx)/(B(x)sqrt(S(x))), (2) where A(x), B(x), C(x), and D(x) ...
A (-1,0,1)-matrix is a matrix whose elements consist only of the numbers -1, 0, or 1. The number of distinct (-1,0,1)-n×n matrices (counting row and column permutations, the ...
A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...
A puzzle in logic in which one or more facts must be inferred from a set of given facts.
![](/common/images/search/spacer.gif)
...