bibase moll Free Number １２０５{８９２}１８６２ Customer Support USA heine

SearchAdvancedHelp

(0.004 seconds)

1—10 of 271 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: 20.12 Mathematical Applications

… ►

§20.12(i) Number Theory

►For applications of ${\theta }_3(0,q)$ to problems involving sums of squares of integers see §27.13(iv), and for extensions see Estermann (1959), Serre (1973, pp. 106–109), Koblitz (1993, pp. 176–177), and McKean and Moll (1999, pp. 142–143). ►For applications of Jacobi’s triple product (20.5.9) to Ramanujan’s $\tau \left(n\right)$ function and Euler’s pentagonal numbers see Hardy and Wright (1979, pp. 132–160) and McKean and Moll (1999, pp. 143–145). … ►For the terminology and notation see McKean and Moll (1999, pp. 48–53). ►The space of complex tori $ℂ/(\mathbb{Z}+\tau \mathbb{Z})$ (that is, the set of complex numbers $z$ in which two of these numbers $z_1$ and $z_2$ are regarded as equivalent if there exist integers $m,n$ such that $z_1-z_2=m+\tau n$) is mapped into the projective space $P^3$ via the identification $z\to ({\theta }_1\left(2z\right|\tau ),{\theta }_2\left(2z\right|\tau ),{\theta }_3\left(2z\right|\tau ),{\theta }_4\left(2z\right|\tau ))$. …

3: Customize DLMF

Customize DLMF

You can customize the appearance and functionality of the DLMF site using these selections. Note: Javascript and Cookies must be enabled to support customizations.

4: 17.9 Further Transformations of ${}_{r+1}{}^{}\varphi _r^{}$ Functions

… ►

§17.9(iv) Bibasic Series

►

Mixed-Base Heine-Type Transformations

…

5: 22 Jacobian Elliptic Functions

…

6: 23 Weierstrass Elliptic and Modular
Functions

…

7: 22.18 Mathematical Applications

… ►See Akhiezer (1990, Chapter 8) and McKean and Moll (1999, Chapter 2) for discussions of the inverse mapping. … ►Algebraic curves of the form $y^2=P(x)$, where $P$ is a nonsingular polynomial of degree 3 or 4 (see McKean and Moll (1999, §1.10)), are elliptic curves, which are also considered in §23.20(ii). …This provides an abelian group structure, and leads to important results in number theory, discussed in an elementary manner by Silverman and Tate (1992), and more fully by Koblitz (1993, Chapter 1, especially §1.7) and McKean and Moll (1999, Chapter 3). …With the identification $x=\mathrm{sn}(z,k)$, $y=d(\mathrm{sn}(z,k))/dz$, the addition law (22.18.8) is transformed into the addition theorem (22.8.1); see Akhiezer (1990, pp. 42, 45, 73–74) and McKean and Moll (1999, §§2.14, 2.16). The theory of elliptic functions brings together complex analysis, algebraic curves, number theory, and geometry: Lang (1987), Siegel (1988), and Serre (1973). …

8: 20 Theta Functions

…

9: Bibliography M

… ►

ⓘ

Notes:

System for the manipulation of symbolic and numerical expressions. Includes a collection of special functions. Utilizes exact fractions, arbitrary precision integers, and arbitrary precision floating point numbers.

External Links:

Home Page

Referenced by:

§ ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

… ►

Elliptic Curves. Cambridge University Press, Cambridge.

ⓘ

Notes:

Reprint with corrections of original edition, published in 1997 by Cambridge University Press

External Links:

ISBN 0-521-58228-8; 0-521-65817-9, MathReview (Amílcar Pacheco), ZentralBlatt

Referenced by:

§20.1, §20.11(i), §20.11(ii), §20.12(i), §20.12(i), §20.12(ii), §20.7(iii), §20.7(v), §20.9(i), §20.9(ii), Ch.20, §22.18(ii), §22.18(iv), Ch.22, §23.1, §23.15(i), §23.20(i), §23.20(ii), §23.20(ii), §23.21(ii), §23.22(ii), §23.6(iv), Ch.23, Notations T.

Encodings:

BibTeX

… ►

Methods and Programs for Mathematical Functions. Ellis Horwood Ltd., Chichester.

ⓘ

Notes:

Includes diskette

External Links:

ISBN 0-13-578998-2, MathReview, ZentralBlatt

Referenced by:

2nd item, CEPHES (free C library).

Encodings:

BibTeX

… ►

ⓘ

Notes:

MPFR is a C library for multiple-precision floating-point computations with correct rounding. The main goal of MPFR is to provide a library for multiple-precision floating-point computation which is both efficient and has well-defined semantics. MPFR includes most of the elementary functions. It also implements the gamma function, and more special functions are planned in the future.

External Links:

MPFR

Referenced by:

§ ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

►

ⓘ

Notes:

Mpmath is a pure-Python library for multiprecision floating-point arithmetic. It provides an extensive set of transcendental functions, unlimited exponent sizes, complex numbers, interval arithmetic, numerical integration and differentiation, root-finding, linear algebra, and much more.

External Links:

mpmath

Referenced by:

§ ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index, § ‣ Software Cross Index.

Encodings:

BibTeX

…

10: 23.20 Mathematical Applications

… ►It follows from the addition formula (23.10.1) that the points $P_j=P(z_j)$, $j=1,2,3$, have zero sum iff $z_1+z_2+z_3\in 𝕃$, so that addition of points on the curve $C$ corresponds to addition of parameters $z_j$ on the torus $ℂ/𝕃$; see McKean and Moll (1999, §§2.11, 2.14). … ►The geometric nature of this construction is illustrated in McKean and Moll (1999, §2.14), Koblitz (1993, §§6, 7), and Silverman and Tate (1992, Chapter 1, §§3, 4): each of these references makes a connection with the addition theorem (23.10.1). … ►To determine $T$, we make use of the fact that if $(x,y)\in T$ then $y^2$ must be a divisor of $\mathrm{\Delta }$; hence there are only a finite number of possibilities for $y$. … ►

§23.20(v) Modular Functions and Number Theory

►For applications of modular functions to number theory see §27.14(iv) and Apostol (1990). …