relation%20to%20inverse%20Gudermannian%20function

SearchAdvancedHelp

(0.006 seconds)

11—20 of 1012 matching pages

11: 25.12 Polylogarithms

… ►The remainder of the equations in this subsection apply to principal branches. … ►The special case $z=1$ is the Riemann zeta function: $\zeta \left(s\right)={\mathrm{Li}}_s\left(1\right)$. … ►Further properties include …and … ►In terms of polylogarithms …

12: 20 Theta Functions

Chapter 20 Theta Functions

…

13: 23.15 Definitions

§23.15 Definitions

… ►A modular function $f(\tau )$ is a function of $\tau$ that is meromorphic in the half-plane $\mathrm{\Im }\tau >0$, and has the property that for all $𝒜\in \text{SL}(2,\mathbb{Z})$, or for all $𝒜$ belonging to a subgroup of SL$(2,\mathbb{Z})$, …(Some references refer to $2\mathrm{\ell }$ as the level). …If, in addition, $f(\tau )\to 0$ as $q\to 0$, then $f(\tau )$ is called a cusp form. … ►

14: Tom M. Apostol

… ►Apostol was born on August 20, 1923. … ►He was also a coauthor of three textbooks written to accompany the physics telecourse The Mechanical Universe …and Beyond. … ►In 1998, the Mathematical Association of America (MAA) awarded him the annual Trevor Evans Award, presented to authors of an exceptional article that is accessible to undergraduates, for his piece entitled “What Is the Most Surprising Result in Mathematics?” (Answer: the prime number theorem). … Ford Award, given to recognize authors of articles of expository excellence. … ►

25 Zeta and Related Functions

…

15: 27.2 Functions

… ►($\nu \left(1\right)$ is defined to be 0.) Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. …They tend to thin out among the large integers, but this thinning out is not completely regular. … ►the sum of the $k$th powers of the positive integers $m\le n$ that are relatively prime to $n$. … ►is the number of $k$-tuples of integers $\le n$ whose greatest common divisor is relatively prime to $n$. …

16: 26.13 Permutations: Cycle Notation

… ►They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … ►A permutation that consists of a single cycle of length $k$ can be written as the composition of $k-1$ two-cycles (read from right to left): … ►A permutation is even or odd according to the parity of the number of transpositions. … ►Given a permutation $\sigma \in {𝔖}_n$, the inversion number of $\sigma$, denoted $inv(\sigma )$, is the least number of adjacent transpositions required to represent $\sigma$. …

17: Bibliography I

… ►

The real roots of Bernoulli polynomials. Ann. Univ. Turku. Ser. A I 37, pp. 1–20.

ⓘ

External Links:

MathReview (D. H. Lehmer), ZentralBlatt

Referenced by:

§24.12(i).

Encodings:

BibTeX

… ►

Special Functions, $q$-Series and Related Topics. Fields Institute Communications, Vol. 14, American Mathematical Society, Providence, RI.

ⓘ

External Links:

ISBN 0-8218-0524-X, Document, Link, MathReview Entry, ZentralBlatt

Referenced by:

Profile Mourad E.H. Ismail.

Encodings:

BibTeX

►

Two families of orthogonal polynomials related to Jacobi polynomials. Rocky Mountain J. Math. 21 (1), pp. 359–375.

ⓘ

External Links:

ISSN 0035-7596, MathReview (Joaquin Bustoz), ZentralBlatt

Referenced by:

§18.30(i).

Encodings:

BibTeX

►

Bounds for the small real and purely imaginary zeros of Bessel and related functions. Methods Appl. Anal. 2 (1), pp. 1–21.

ⓘ

External Links:

ISSN 1073-2772, FullText, MathReview (Andrea Laforgia), ZentralBlatt

Referenced by:

§10.21(v).

Encodings:

BibTeX

… ►

The method of isomonodromic deformations and relation formulas for the second Painlevé transcendent. Izv. Akad. Nauk SSSR Ser. Mat. 51 (4), pp. 878–892, 912 (Russian).

ⓘ

Notes:

In Russian. English translation: Math. USSR-Izv. 31(1988), no. 1, pp. 193–207

External Links:

ISSN 0373-2436, Document, MathReview (Alexander A. Pankov), ZentralBlatt

Referenced by:

§32.11(iii).

Encodings:

BibTeX

…

18: 26.3 Lattice Paths: Binomial Coefficients

… ►

§26.3(i) Definitions

► $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$ is the number of ways of choosing $n$ objects from a collection of $m$ distinct objects without regard to order. $\left(\genfrac{}{}{0.0pt}{}{m+n}{n}\right)$ is the number of lattice paths from $(0,0)$ to $(m,n)$. …The number of lattice paths from $(0,0)$ to $(m,n)$, $m\le n$, that stay on or above the line $y=x$ is $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)-\left(\genfrac{}{}{0.0pt}{}{m+n}{m-1}\right).$ … ►

§26.3(iii) Recurrence Relations

…

19: 19.10 Relations to Other Functions

§19.10 Relations to Other Functions

►

§19.10(i) Theta and Elliptic Functions

►For relations of Legendre’s integrals to theta functions, Jacobian functions, and Weierstrass functions, see §§20.9(i), 22.15(ii), and 23.6(iv), respectively. … ►

§19.10(ii) Elementary Functions

… ►For relations to the Gudermannian function $\mathrm{gd}\left(x\right)$ and its inverse ${\mathrm{gd}}^{-1}\left(x\right)$ (§4.23(viii)), see (19.6.8) and …

20: 26.5 Lattice Paths: Catalan Numbers

… ►

§26.5(i) Definitions

… ►It counts the number of lattice paths from $(0,0)$ to $(n,n)$ that stay on or above the line $y=x$. … ►

§26.5(ii) Generating Function

… ►

§26.5(iii) Recurrence Relations

… ►

26.5.6 $$C\left(n\right)\sim \frac{4^n}{\sqrt{\pi n^3}},$$ $n\to \mathrm{\infty }$,

ⓘ

Symbols:

$C\left(n\right)$: Catalan number, $\sim$: asymptotic equality, $\pi$: the ratio of the circumference of a circle to its diameter and $n$: nonnegative integer

Permalink:

http://dlmf.nist.gov/26.5.E6

Encodings:

pMML, png, TeX

See also:

Annotations for §26.5(iv), §26.5 and Ch.26

…