Search Results for ""
8461 - 8470 of 13135 for Coordinate GeometrySearch Results
Define I_n=(-1)^nint_0^infty(lnz)^ne^(-z)dz, (1) then I_n=(-1)^nGamma^((n))(1), (2) where Gamma^((n))(z) is the nth derivative of the gamma function. Particular values ...
An implicit method for solving an ordinary differential equation that uses f(x_n,y_n) in y_(n+1). In the case of a heat equation, for example, this means that a linear system ...
The general nonhomogeneous differential equation is given by x^2(d^2y)/(dx^2)+alphax(dy)/(dx)+betay=S(x), (1) and the homogeneous equation is x^2y^('')+alphaxy^'+betay=0 (2) ...
A method for solving ordinary differential equations using the formula y_(n+1)=y_n+hf(x_n,y_n), which advances a solution from x_n to x_(n+1)=x_n+h. Note that the method ...
The amazing polynomial identity communicated by Euler in a letter to Goldbach on April 12, 1749 (incorrectly given as April 15, 1705--before Euler was born--in Conway and Guy ...
The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...
For |z|<1, product_(k=1)^infty(1+z^k)=product_(k=1)^infty(1-z^(2k-1))^(-1). (1) Both of these have closed form representation 1/2(-1;z)_infty, (2) where (a;q)_infty is a ...
An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...
Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...
A square array made by combining n objects of two types such that the first and second elements form Latin squares. Euler squares are also known as Graeco-Latin squares, ...
...