identities

SearchAdvancedHelp

(0.000 seconds)

1—10 of 142 matching pages

1: 24.10 Arithmetic Properties

… ►where $m\equiv n\cancel{\equiv }0(modp-1)$. …valid when $m\equiv n(mod(p-1)p^{\mathrm{\ell }})$ and $n\cancel{\equiv }0(modp-1)$, where $\mathrm{\ell }(\ge 0)$ is a fixed integer. … ►

24.10.8 $$N_{2n}\equiv 0(mod{p}^{\mathrm{\ell }}),$$

ⓘ

Symbols:

$\equiv$: modular equivalence, $\mathrm{\ell }$: integer, $n$: integer and $p$: prime

Referenced by:

§24.10(iv)

Permalink:

http://dlmf.nist.gov/24.10.E8

Encodings:

pMML, png, TeX

See also:

Annotations for §24.10(iv), §24.10 and Ch.24

►valid for fixed integers $\mathrm{\ell }(\ge 1)$, and for all $n(\ge 1)$ such that $2n\cancel{\equiv }0$ $(modp-1)$ and $p^{\mathrm{\ell }}|2n$. ►

24.10.9

ⓘ

Symbols:

$E_n$: Euler numbers, $\equiv$: modular equivalence, $\mathrm{\ell }$: integer, $n$: integer and $p$: prime

Referenced by:

§24.10(iv)

Permalink:

http://dlmf.nist.gov/24.10.E9

Encodings:

pMML, png, TeX

See also:

Annotations for §24.10(iv), §24.10 and Ch.24

…

2: 27.16 Cryptography

… ►Thus, $y\equiv x^r(modn)$ and . … ►By the Euler–Fermat theorem (27.2.8), $x^{\varphi \left(n\right)}\equiv 1(modn)$; hence $x^{t\varphi \left(n\right)}\equiv 1(modn)$. But $y^s\equiv x^{rs}\equiv x^{1+t\varphi \left(n\right)}\equiv x(modn)$, so $y^s$ is the same as $x$ modulo $n$. …

3: 36.9 Integral Identities

§36.9 Integral Identities

… ►

36.9.9 $${\left|{\mathrm{\Psi }}^{(\mathrm{E})}\left(x,y,z\right)\right|}^2=\frac{8{\pi }^2}{3^{2/3}}{\int }_0^{\mathrm{\infty }}{\int }_0^{2\pi }\mathrm{\Re }\left(\mathrm{Ai}\left(\frac{1}{3^{1/3}}\left(x+\mathrm{i}y+2zu\exp \left(\mathrm{i}\theta \right)+3u^2\exp \left(-2\mathrm{i}\theta \right)\right)\right)\mathrm{Bi}\left(\frac{1}{3^{1/3}}\left(x-\mathrm{i}y+2zu\exp \left(-\mathrm{i}\theta \right)+3u^2\exp \left(2\mathrm{i}\theta \right)\right)\right)\right)udud\theta .$$

ⓘ

Symbols:

$\mathrm{Ai}\left(z\right)$: Airy function, $\mathrm{Bi}\left(z\right)$: Airy function, $\pi$: the ratio of the circumference of a circle to its diameter, $dx$: differential of $x$ , ${\mathrm{\Psi }}^{(\mathrm{E})}\left(𝐱\right)$: elliptic umbilic canonical integral function, $\exp z$: exponential function, $\mathrm{i}$: imaginary unit, $\int$: integral, $\mathrm{\Re }$: real part, $y$: real parameter, $z$: real parameter and $x$: real parameter

Keywords:

elliptic umbilic canonical integral, integral identity

Permalink:

http://dlmf.nist.gov/36.9.E9

Encodings:

pMML, png, TeX

See also:

Annotations for §36.9 and Ch.36

… ►

4: 26.21 Tables

… ►Andrews (1976) contains tables of the number of unrestricted partitions, partitions into odd parts, partitions into parts $\cancel{\equiv }\pm 2(mod5)$, partitions into parts $\cancel{\equiv }\pm 1(mod5)$, and unrestricted plane partitions up to 100. …

5: 22.9 Cyclic Identities

§22.9 Cyclic Identities

… ►

§22.9(ii) Typical Identities of Rank 2

… ► ►

§22.9(iii) Typical Identities of Rank 3

… ►

6: 24.5 Recurrence Relations

… ►

§24.5(ii) Other Identities

… ►

§24.5(iii) Inversion Formulas

►In each of (24.5.9) and (24.5.10) the first identity implies the second one and vice-versa. …

7: 15.17 Mathematical Applications

… ►

§15.17(iv) Combinatorics

►In combinatorics, hypergeometric identities classify single sums of products of binomial coefficients. …

8: 27.15 Chinese Remainder Theorem

… ►The Chinese remainder theorem states that a system of congruences $x\equiv a_1(mod{m}_1),\mathrm{\dots },x\equiv a_k(mod{m}_k)$, always has a solution if the moduli are relatively prime in pairs; the solution is unique (mod $m$), where $m$ is the product of the moduli. …

9: 17.17 Physical Applications

… ►In exactly solved models in statistical mechanics (Baxter (1981, 1982)) the methods and identities of §17.12 play a substantial role. …

10: 17.18 Methods of Computation

… ►Lehner (1941) uses Method (2) in connection with the Rogers–Ramanujan identities. …