Search Results for ""
1861 - 1870 of 2466 for Third_fundamental_formSearch Results
The inverse erf function is the inverse function erf^(-1)(z) of the erf function erf(x) such that erf(erf^(-1)(x)) = x (1) erf^(-1)(erf(x)) = x, (2) with the first identity ...
Kloosterman's sum is defined by S(u,v,n)=sum_(h)exp[(2pii(uh+vh^_))/n], (1) where h runs through a complete set of residues relatively prime to n and h^_ is defined by hh^_=1 ...
There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...
In spherical coordinates, the scale factors are h_r=1, h_theta=rsinphi, h_phi=r, and the separation functions are f_1(r)=r^2, f_2(theta)=1, f_3(phi)=sinphi, giving a Stäckel ...
A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...
A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...
The Mercator projection is a map projection that was widely used for navigation since loxodromes are straight lines (although great circles are curved). The following ...
A module is a mathematical object in which things can be added together commutatively by multiplying coefficients and in which most of the rules of manipulating vectors hold. ...
A prolate spheroid is a spheroid that is "pointy" instead of "squashed," i.e., one for which the polar radius c is greater than the equatorial radius a, so c>a (called ...
A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...
...
View search results from all Wolfram sites (344255 matches)

