Search Results for ""
711 - 720 of 3638 for Ordinary Differential Equation Systemwit...Search Results

Adams' method is a numerical method for solving linear first-order ordinary differential equations of the form (dy)/(dx)=f(x,y). (1) Let h=x_(n+1)-x_n (2) be the step ...
The probability that a random integer between 1 and x will have its greatest prime factor <=x^alpha approaches a limiting value F(alpha) as x->infty, where F(alpha)=1 for ...
Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...
The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...
The Enneper surfaces are a three-parameter family of surfaces with constant negative curvature (and nonconstant mean curvature). In general, they are described by elliptic ...
The Prelle-Singer method is a semi-decision procedure for solving nonlinear first-order ordinary differential equations of the form y^'=P(x,y)/Q(x,y), where P and Q are ...
The Christoffel symbols are tensor-like objects derived from a Riemannian metric g. They are used to study the geometry of the metric and appear, for example, in the geodesic ...
Meißner (1911) showed how to modify the Reuleaux tetrahedron (which is not a solid of constant width) to form a surface of constant width by replacing three of its edge arcs ...
A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...
A root of a polynomial P(z) is a number z_i such that P(z_i)=0. The fundamental theorem of algebra states that a polynomial P(z) of degree n has n roots, some of which may be ...

...