TOPICS
Search

Search Results for ""


1091 - 1100 of 3632 for Diophantine Equation 2nd PowersSearch Results
A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...
Given a formula y=f(x) with an absolute error in x of dx, the absolute error is dy. The relative error is dy/y. If x=f(u,v,...), then ...
A univariate function f(x) is said to be even provided that f(x)=f(-x). Geometrically, such functions are symmetric about the y-axis. Examples of even functions include 1 ...
Each of the sacred unit fractions which the ancient Egyptians attributed to the six parts of the eye of the god Horus: 1/2, 1/4, 1/8, 1/16, 1/32, and 1/64. These fractions, ...
Fractran is an algorithm applied to a given list f_1, f_2, ..., f_k of fractions. Given a starting integer N, the FRACTRAN algorithm proceeds by repeatedly multiplying the ...
Let (x_1,x_2) and (y_1,y_2) be two sets of complex numbers linearly independent over the rationals. Then the four exponential conjecture posits that at least one of ...
A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...
A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...
If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...
The operator tpartial/partialr that can be used to derive multivariate formulas for moments and cumulants from corresponding univariate formulas. For example, to derive the ...
1 ... 107|108|109|110|111|112|113 ... 364 Previous Next

...