Search Results for ""
1881 - 1890 of 13135 for Babylonian Number SystemSearch Results
The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...
The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...
The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
The 6.1.2 equation A^6=B^6+C^6 (1) is a special case of Fermat's last theorem with n=6, and so has no solution. No 6.1.n solutions are known for n<=6 (Lander et al. 1967; Guy ...
A Thâbit ibn Kurrah prime, sometimes called a 321-prime, is a Thâbit ibn Kurrah number (i.e., a number of the form 3·2^n-1 for nonnegative integer n) that is prime. The ...
The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method and symmetric LQ ...
Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...
A fixed point for which the stability matrix has eigenvalues of the form lambda_+/-=-alpha+/-ibeta (with alpha,beta>0).
Differential Geometry
...
View search results from all Wolfram sites (185317 matches)

