strictly%20increasing

SearchAdvancedHelp

(0.001 seconds)

11—20 of 146 matching pages

11: 26.2 Basic Definitions

… ►A k-dimensional lattice path is a directed path composed of segments that connect vertices in ${\{0,1,2,\mathrm{\dots }\}}^k$ so that each segment increases one coordinate by exactly one unit. … ►

Table 26.2.1: Partitions $p\left(n\right)$.

► ►►►

$n$	$p\left(n\right)$	$n$	$p\left(n\right)$	$n$	$p\left(n\right)$
…
3	3	20	627	37	21637
…

►

12: 1.11 Zeros of Polynomials

… ►Resolvent cubic is $z^3+12z^2+20z+9=0$ with roots ${\theta }_1=-1$, ${\theta }_2=-\frac{1}{2}(11+\sqrt{85})$, ${\theta }_3=-\frac{1}{2}(11-\sqrt{85})$, and $\sqrt{-{\theta }_1}=1$, $\sqrt{-{\theta }_2}=\frac{1}{2}(\sqrt{17}+\sqrt{5})$, $\sqrt{-{\theta }_3}=\frac{1}{2}(\sqrt{17}-\sqrt{5})$. … ►with real coefficients, is called stable if the real parts of all the zeros are strictly negative. …

13: 27.2 Functions

… ►Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … ►An equivalent form states that the $n$th prime $p_n$ (when the primes are listed in increasing order) is asymptotic to $n\ln n$ as $n\to \mathrm{\infty }$: … ►

Table 27.2.2: Functions related to division.

► ►►►►►

$n$	$\varphi \left(n\right)$	$d\left(n\right)$	$\sigma \left(n\right)$	$n$	$\varphi \left(n\right)$	$d\left(n\right)$	$\sigma \left(n\right)$	$n$	$\varphi \left(n\right)$	$d\left(n\right)$	$\sigma \left(n\right)$	$n$	$\varphi \left(n\right)$	$d\left(n\right)$	$\sigma \left(n\right)$
…
5	4	2	6	18	6	6	39	31	30	2	32	44	20	6	84
6	2	4	12	19	18	2	20	32	16	6	63	45	24	6	78
7	6	2	8	20	8	6	42	33	20	4	48	46	22	4	72
…

►

14: 21.1 Special Notation

… ► ►►►

$g,h$	positive integers.
…
$𝛀$	$g\times g$ complex, symmetric matrix with $\mathrm{\Im }𝛀$ strictly positive definite, i.e., a Riemann matrix.
…

…

15: 23.20 Mathematical Applications

… ►The boundary of the rectangle $R$, with vertices $0$, ${\omega }_1$, ${\omega }_1+{\omega }_3$, ${\omega }_3$, is mapped strictly monotonically by $\mathrm{\wp }$ onto the real line with $0\to \mathrm{\infty }$, ${\omega }_1\to e_1$, ${\omega }_1+{\omega }_3\to e_2$, ${\omega }_3\to e_3$, $0\to -\mathrm{\infty }$. … ►The two pairs of edges $[0,{\omega }_1]\cup [{\omega }_1,2{\omega }_3]$ and $[2{\omega }_3,2{\omega }_3-{\omega }_1]\cup [2{\omega }_3-{\omega }_1,0]$ of $R$ are each mapped strictly monotonically by $\mathrm{\wp }$ onto the real line, with $0\to \mathrm{\infty }$, ${\omega }_1\to e_1$, $2{\omega }_3\to -\mathrm{\infty }$; similarly for the other pair of edges. …

16: 27.17 Other Applications

… ►Reed et al. (1990, pp. 458–470) describes a number-theoretic approach to Fourier analysis (called the arithmetic Fourier transform) that uses the Möbius inversion (27.5.7) to increase efficiency in computing coefficients of Fourier series. …

17: 33.23 Methods of Computation

… ►Cancellation errors increase with increases in $\rho$ and $|r|$, and may be estimated by comparing the final sum of the series with the largest partial sum. Use of extended-precision arithmetic increases the radial range that yields accurate results, but eventually other methods must be employed, for example, the asymptotic expansions of §§33.11 and 33.21. … ►Thus the regular solutions can be computed from the power-series expansions (§§33.6, 33.19) for small values of the radii and then integrated in the direction of increasing values of the radii. … ►This implies decreasing $\mathrm{\ell }$ for the regular solutions and increasing $\mathrm{\ell }$ for the irregular solutions of §§33.2(iii) and 33.14(iii). …

18: 8 Incomplete Gamma and Related
Functions

…

19: 28 Mathieu Functions and Hill’s Equation

…

20: 8.26 Tables

… ►

Khamis (1965) tabulates $P(a,x)$ for $a=0.05(.05)10(.1)20(.25)70$, $0.0001\le x\le 250$ to 10D.

… ►

Abramowitz and Stegun (1964, pp. 245–248) tabulates $E_n\left(x\right)$ for $n=2,3,4,10,20$, $x=0(.01)2$ to 7D; also $(x+n){\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2,3,4,10,20$, $x^{-1}=0(.01)0.1(.05)0.5$ to 6S.

… ►

Pagurova (1961) tabulates $E_n\left(x\right)$ for $n=0(1)20$, $x=0(.01)2(.1)10$ to 4-9S; ${\mathrm{e}}^x{E}_n\left(x\right)$ for $n=2(1)10$, $x=10(.1)20$ to 7D; ${\mathrm{e}}^x{E}_p\left(x\right)$ for $p=0(.1)1$, $x=0.01(.01)7(.05)12(.1)20$ to 7S or 7D.

… ►

Zhang and Jin (1996, Table 19.1) tabulates $E_n\left(x\right)$ for $n=1,2,3,5,10,15,20$, $x=0(.1)1,1.5,2,3,5,10,20,30,50,100$ to 7D or 8S.