Search Results for ""
301 - 310 of 1293 for Euler Forward MethodSearch Results
A branch of mathematics that is a sort of generalization of calculus. Calculus of variations seeks to find the path, curve, surface, etc., for which a given function has a ...
The orthocentroidal circle of a triangle DeltaABC is a central circle having the segment joining the triangle centroid G and orthocenter H of DeltaABC as its diameter ...
The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...
The far-out point F of a triangle DeltaABC is the inverse point of the triangle centroid with respect to the circumcircle of DeltaABC. For a triangle with side lengths a, b, ...
A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...
An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. ...
A method which can be used to solve any quadratic congruence equation. This technique relies on the fact that solving x^2=b (mod p) is equivalent to finding a value y such ...
A curve on which points of a map z_n (such as the Mandelbrot set) diverge to a given value r_(max) at the same rate. A common method of obtaining lemniscates is to define an ...
The number of "arrangements" in an ordering of n items is given by either a combination (order is ignored) or a permutation (order is significant). An ordering (or order) is ...
...
View search results from all Wolfram sites (21560 matches)

