TOPICS
Search

Search Results for ""


241 - 250 of 1293 for Euler Forward MethodSearch Results
The nine-point circle, also called Euler's circle or the Feuerbach circle, is the circle that passes through the perpendicular feet H_A, H_B, and H_C dropped from the ...
In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...
The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...
An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...
An affine geometry is a geometry in which properties are preserved by parallel projection from one plane to another. In an affine geometry, the third and fourth of Euclid's ...
If q_n is the nth prime such that M_(q_n) is a Mersenne prime, then q_n∼(3/2)^n. It was modified by Wagstaff (1983) to yield Wagstaff's conjecture, q_n∼(2^(e^(-gamma)))^n, ...
A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...
The parameters alpha, beta, gamma, and delta which, like the three Euler angles, provide a way to uniquely characterize the orientation of a solid body. These parameters ...
The constant e is base of the natural logarithm. e is sometimes known as Napier's constant, although its symbol (e) honors Euler. e is the unique number with the property ...
At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...
1 ... 22|23|24|25|26|27|28 ... 130 Previous Next

...