Emirates Airlines Reservation Number 832.615.6786

SearchAdvancedHelp

(0.002 seconds)

31—40 of 226 matching pages

31: 24.21 Software

… ►

§24.21(ii) $B_n$, $B_n\left(x\right)$, $E_n$, and $E_n\left(x\right)$

…

32: 27.19 Methods of Computation: Factorization

… ►Techniques for factorization of integers fall into three general classes: Deterministic algorithms, Type I probabilistic algorithms whose expected running time depends on the size of the smallest prime factor, and Type II probabilistic algorithms whose expected running time depends on the size of the number to be factored. … ►As of January 2009 the largest prime factors found by these methods are a 19-digit prime for Brent–Pollard rho, a 58-digit prime for Pollard $p-1$, and a 67-digit prime for ecm. … ►These algorithms include the Continued Fraction Algorithm (cfrac), the Multiple Polynomial Quadratic Sieve (mpqs), the General Number Field Sieve (gnfs), and the Special Number Field Sieve (snfs). …The snfs can be applied only to numbers that are very close to a power of a very small base. The largest composite numbers that have been factored by other Type II probabilistic algorithms are a 63-digit integer by cfrac, a 135-digit integer by mpqs, and a 182-digit integer by gnfs. …

33: 26.17 The Twelvefold Way

… ►The twelvefold way gives the number of mappings $f$ from set $N$ of $n$ objects to set $K$ of $k$ objects (putting balls from set $N$ into boxes in set $K$). …In this table ${\left(k\right)}_n$ is Pochhammer’s symbol, and $S(n,k)$ and $p_k\left(n\right)$ are defined in §§26.8(i) and 26.9(i). … ►

Table 26.17.1: The twelvefold way.

► ►►►►

elements of $N$	elements of $K$	$f$ unrestricted	$f$ one-to-one	$f$ onto
labeled	labeled	$k^n$	${\left(k-n+1\right)}_n$	$k!S(n,k)$
…
labeled	unlabeled	$\begin{array}{c}S(n,1)+S(n,2)\\ +\mathrm{\cdots }+S(n,k)\end{array}$		$S(n,k)$
…

►

34: 24.20 Tables

§24.20 Tables

… ►Wagstaff (1978) gives complete prime factorizations of $N_n$ and $E_n$ for $n=20(2)60$ and $n=8(2)42$, respectively. …

35: 24.9 Inequalities

§24.9 Inequalities

… ►

24.9.1 $$|B_{2n}|>|B_{2n}\left(x\right)|,$$ $1>x>0$,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $B_n\left(x\right)$: Bernoulli polynomials, $n$: integer and $x$: real or complex

A&S Ref:

23.1.13

Referenced by:

§24.9

Permalink:

http://dlmf.nist.gov/24.9.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

►

24.9.2 $$(2-2^{1-2n})|B_{2n}|\ge |B_{2n}\left(x\right)-B_{2n}|,$$ $1\ge x\ge 0$.

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $B_n\left(x\right)$: Bernoulli polynomials, $n$: integer and $x$: real or complex

Referenced by:

§24.9

Permalink:

http://dlmf.nist.gov/24.9.E2

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

… ►

24.9.3 $$4^{-n}|E_{2n}|>{(-1)}^n{E}_{2n}\left(x\right)>0,$$

ⓘ

Symbols:

$E_n$: Euler numbers, $E_n\left(x\right)$: Euler polynomials, $n$: integer and $x$: real or complex

A&S Ref:

23.1.13

Referenced by:

§24.9, §24.9

Permalink:

http://dlmf.nist.gov/24.9.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

… ►

24.9.6 $$5\sqrt{\pi n}{\left(\frac{n}{\pi \mathrm{e}}\right)}^{2n}>{(-1)}^{n+1}{B}_{2n}>4\sqrt{\pi n}{\left(\frac{n}{\pi \mathrm{e}}\right)}^{2n},$$

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $\mathrm{e}$: base of natural logarithm and $n$: integer

Referenced by:

§24.9, §24.9

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

…

36: 4.19 Maclaurin Series and Laurent Series

… ►In (4.19.3)–(4.19.9), $B_n$ are the Bernoulli numbers and $E_n$ are the Euler numbers (§§24.2(i)–24.2(ii)). ►

4.19.3 $$\tan z=z+\frac{z^3}{3}+\frac{2}{15}{z}^5+\frac{17}{315}{z}^7+\mathrm{\cdots }+\frac{{(-1)}^{n-1}{2}^{2n}(2^{2n}-1)B_{2n}}{(2n)!}{z}^{2n-1}+\mathrm{\cdots },$$ ,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $!$: factorial (as in $n!$), $\tan z$: tangent function, $n$: integer and $z$: complex variable

A&S Ref:

4.3.67

Referenced by:

§4.19

Permalink:

http://dlmf.nist.gov/4.19.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

►

4.19.4 $$\csc z=\frac{1}{z}+\frac{z}{6}+\frac{7}{360}{z}^3+\frac{31}{15120}{z}^5+\mathrm{\cdots }+\frac{{(-1)}^{n-1}2(2^{2n-1}-1)B_{2n}}{(2n)!}{z}^{2n-1}+\mathrm{\cdots },$$ ,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $\csc z$: cosecant function, $!$: factorial (as in $n!$), $n$: integer and $z$: complex variable

A&S Ref:

4.3.68

Referenced by:

§4.33

Permalink:

http://dlmf.nist.gov/4.19.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

►

4.19.5 $$\sec z=1+\frac{z^2}{2}+\frac{5}{24}{z}^4+\frac{61}{720}{z}^6+\mathrm{\cdots }+\frac{{(-1)}^n{E}_{2n}}{(2n)!}{z}^{2n}+\mathrm{\cdots },$$ ,

ⓘ

Symbols:

$E_n$: Euler numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $!$: factorial (as in $n!$), $\sec z$: secant function, $n$: integer and $z$: complex variable

A&S Ref:

4.3.69

Referenced by:

§24.1, §24.19(i), §24.2(ii)

Permalink:

http://dlmf.nist.gov/4.19.E5

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

►

4.19.6 $$\cot z=\frac{1}{z}-\frac{z}{3}-\frac{z^3}{45}-\frac{2}{945}{z}^5-\mathrm{\cdots }-\frac{{(-1)}^{n-1}{2}^{2n}{B}_{2n}}{(2n)!}{z}^{2n-1}-\mathrm{\cdots },$$ ,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $\cot z$: cotangent function, $!$: factorial (as in $n!$), $n$: integer and $z$: complex variable

A&S Ref:

4.3.70

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

…

37: 27.16 Cryptography

§27.16 Cryptography

… ►The primes are kept secret but their product $n=pq$, an 800-digit number, is made public. …With the most efficient computer techniques devised to date (2010), factoring an 800-digit number may require billions of years on a single computer. For this reason, the codes are considered unbreakable, at least with the current state of knowledge on factoring large numbers. … ►Thus, $y\equiv x^r(modn)$ and . …

38: 27.21 Tables

§27.21 Tables

… ►Bressoud and Wagon (2000, pp. 103–104) supplies tables and graphs that compare $\pi \left(x\right),x/\ln x$, and $\mathrm{li}\left(x\right)$. … ►Lehmer (1941) gives a comprehensive account of tables in the theory of numbers, including virtually every table published from 1918 to 1941. … ►No sequel to Lehmer (1941) exists to date, but many tables of functions of number theory are included in Unpublished Mathematical Tables (1944).

39: 24.4 Basic Properties

… ►

§24.4(iv) Finite Expansions

… ►

24.4.15 $$B_{2n}=\frac{2n}{2^{2n}(2^{2n}-1)}\sum _{k=0}^{n-1}\left(\genfrac{}{}{0pt}{}{2n-1}{2k}\right)E_{2k},$$

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $k$: integer and $n$: integer

Permalink:

http://dlmf.nist.gov/24.4.E15

Encodings:

pMML, png, TeX

See also:

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

►

24.4.16 $$E_{2n}=\frac{1}{2n+1}-\sum _{k=1}^n\left(\genfrac{}{}{0pt}{}{2n}{2k-1}\right)\frac{2^{2k}(2^{2k-1}-1)B_{2k}}{k},$$

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $k$: integer and $n$: integer

Permalink:

http://dlmf.nist.gov/24.4.E16

Encodings:

pMML, png, TeX

See also:

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

… ►

§24.4(ix) Relations to Other Functions

►For the relation of Bernoulli numbers to the Riemann zeta function see §25.6, and to the Eulerian numbers see (26.14.11).

40: 24.2 Definitions and Generating Functions

§24.2 Definitions and Generating Functions

►

§24.2(i) Bernoulli Numbers and Polynomials

… ►

§24.2(ii) Euler Numbers and Polynomials

… ►

Table 24.2.1: Bernoulli and Euler numbers.

► ►►

$n$	$B_n$	$E_n$
…

►

…