Emirates Airlines Reservation Number 832.615.6786
Did you mean Emirates stirlingses Reservation Number 83267 ?
(0.002 seconds)
1—10 of 217 matching pages
1: 24.1 Special Notation
…
►
Bernoulli Numbers and Polynomials
►The origin of the notation ${B}_{n}$, ${B}_{n}\left(x\right)$, is not clear. … ►Euler Numbers and Polynomials
… ►Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations ${E}_{n}$, ${E}_{n}\left(x\right)$, as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …2: Peter L. Walker
…
►was Professor of Mathematics at the American University of Sharjah, Sharjah, United Arab Emirates, in 1997–2005.
…
►Walker’s published work has been mainly in real and complex analysis, with excursions into analytic number theory and geometry, the latter in collaboration with Professor Mowaffaq Hajja of the University of Jordan.
…
3: 20 Theta Functions
…
4: 22 Jacobian Elliptic Functions
…
5: 23 Weierstrass Elliptic and Modular
Functions
…
6: Guide to Searching the DLMF
…
►
term:
►
phrase:
…
►
proximity operator:
…
►
►►►
…
a textual word, a number, or a math symbol.
any doublequoted sequence of textual words and numbers.
adj, prec/n, and near/n, where n is any positive natural number.
$ 
stands for any number of alphanumeric characters 

(the more conventional * is reserved for the multiplication operator) 

… 
7: 27.18 Methods of Computation: Primes
§27.18 Methods of Computation: Primes
►An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer $x$ is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … ►These algorithms are used for testing primality of Mersenne numbers, ${2}^{n}1$, and Fermat numbers, ${2}^{{2}^{n}}+1$. …8: 26.11 Integer Partitions: Compositions
…
►
$c\left(n\right)$ denotes the number of compositions of $n$, and ${c}_{m}\left(n\right)$ is the number of compositions into exactly
$m$ parts.
$c(\in T,n)$ is the number of compositions of $n$ with no 1’s, where again $T=\{2,3,4,\mathrm{\dots}\}$.
…
►
26.11.1
$$c\left(0\right)=c(\in T,0)=1.$$
…
►The Fibonacci numbers are determined recursively by
…
►Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).