Search Results for ""
7821 - 7830 of 13135 for Use of computers and internetSearch Results
Let (q_1,...,q_n,p_1,...,p_n) be any functions of two variables (u,v). Then the expression ...
Given a Taylor series f(x)=f(x_0)+(x-x_0)f^'(x_0)+((x-x_0)^2)/(2!)f^('')(x_0)+... +((x-x_0)^n)/(n!)f^((n))(x_0)+R_n, (1) the error R_n after n terms is given by ...
The partial differential equation (1+f_y^2)f_(xx)-2f_xf_yf_(xy)+(1+f_x^2)f_(yy)=0 (Gray 1997, p. 399), whose solutions are called minimal surfaces. This corresponds to the ...
Let P(N) denote the number of primes of the form n^2+1 for 1<=n<=N, then P(N)∼0.68641li(N), (1) where li(N) is the logarithmic integral (Shanks 1960, pp. 321-332). Let Q(N) ...
The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...
Let lambda be the longitude, lambda_0 the reference longitude, phi the latitude, phi_0 the reference latitude, and phi_1 and phi_2 the standard parallels. Then the ...
An equation proposed by Lambert (1758) and studied by Euler in 1779. x^alpha-x^beta=(alpha-beta)vx^(alpha+beta). (1) When alpha->beta, the equation becomes lnx=vx^beta, (2) ...
The ordinary differential equation (1) (Byerly 1959, p. 255). The solution is denoted E_m^p(x) and is known as an ellipsoidal harmonic of the first kind, or Lamé function. ...
For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...
An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...
...
View search results from all Wolfram sites (204332 matches)

