TOPICS
Search

Search Results for ""


741 - 750 of 1716 for cartesian equationSearch Results
Generalizing from a straight line (i.e., first degree polynomial) to a kth degree polynomial y=a_0+a_1x+...+a_kx^k, (1) the residual is given by ...
The (associated) Legendre function of the first kind P_n^m(z) is the solution to the Legendre differential equation which is regular at the origin. For m,n integers and z ...
A point about which inversion of two circles produced concentric circles. Every pair of distinct circles has two limiting points. The limiting points correspond to the point ...
The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...
The continuous distribution with parameters m and b>0 having probability and distribution functions P(x) = (e^(-(x-m)/b))/(b[1+e^(-(x-m)/b)]^2) (1) D(x) = 1/(1+e^(-(x-m)/b)) ...
The Lommel polynomials R_(m,nu)(z) arise from the equation J_(m+nu)(z)=J_nu(z)R_(m,nu)(z)-J_(nu-1)(z)R_(m-1,nu+1)(z), (1) where J_nu(z) is a Bessel function of the first kind ...
A predictor-corrector method for solution of ordinary differential equations. The third-order equations for predictor and corrector are y_(n+1) = ...
The modified Lommel functions of the first and second kind give the solution to the Lommel differential equation with a minus sign in front of the linear term, i.e., ...
A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...
The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...
1 ... 72|73|74|75|76|77|78 ... 172 Previous Next

...