TOPICS
Search

Search Results for ""


9801 - 9810 of 13135 for Combinatorial MathematicsSearch Results
Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...
If a function analytic at the origin has no singularities other than poles for finite x, and if we can choose a sequence of contours C_m about z=0 tending to infinity such ...
The mittenpunkt (also called the middlespoint) of a triangle DeltaABC is the symmedian point of the excentral triangle, i.e., the point of concurrence M of the lines from the ...
In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...
The mode of a set of observations is the most commonly occurring value. For example, for a data set (3, 7, 3, 9, 9, 3, 5, 1, 8, 5) (left histogram), the unique mode is 3. ...
The second-order ordinary differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)-(x^2+n^2)y=0. (1) The solutions are the modified Bessel functions of the first and second kinds, ...
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., ...
The modified spherical Bessel differential equation is given by the spherical Bessel differential equation with a negative separation constant, ...
The group Gamma of all Möbius transformations of the form tau^'=(atau+b)/(ctau+d), (1) where a, b, c, and d are integers with ad-bc=1. The group can be represented by the 2×2 ...
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, ...
1 ... 978|979|980|981|982|983|984 ... 1314 Previous Next

...