Search Results for ""
531 - 540 of 1293 for Euler Forward MethodSearch Results
Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...
The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...
The de Longchamps point L is the reflection of the orthocenter H about the circumcenter O of a triangle. It has triangle center function alpha=cosA-cosBcosC, (1) and is ...
1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...
A Bäcklund transformation allows additional solutions to a nonlinear partial differential equations to be found if one particular solution is already known.
For the hyperbolic partial differential equation u_(xy) = F(x,y,u,p,q) (1) p = u_x (2) q = u_y (3) on a domain Omega, Goursat's problem asks to find a solution u(x,y) of (3) ...
A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.
The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...
A sequence of approximations a/b to sqrt(n) can be derived by factoring a^2-nb^2=+/-1 (1) (where -1 is possible only if -1 is a quadratic residue of n). Then ...
The theory of point sets and sequences having a uniform distribution. Uniform distribution theory is important in modeling and simulation, and especially in so-called Monte ...
...
View search results from all Wolfram sites (21560 matches)

