Japan Airlines Reservation Number 📞850.308.3021📞

SearchAdvancedHelp

(0.002 seconds)

21—30 of 224 matching pages

21: 27.3 Multiplicative Properties

§27.3 Multiplicative Properties

►Except for $\nu \left(n\right)$, $\mathrm{\Lambda }\left(n\right)$, $p_n$, and $\pi \left(x\right)$, the functions in §27.2 are multiplicative, which means $f(1)=1$ and … ►

27.3.2 $$f(n)=\prod _{r=1}^{\nu \left(n\right)}f(p_r^{a_r}).$$

ⓘ

Symbols:

$\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers, $a_r$: positive exponent and $f(n)$: multiplicative function

Referenced by:

§27.20, §27.20, §27.3

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.3 and Ch.27

… ►

27.3.6 $${\sigma }_{\alpha }\left(n\right)=\prod _{r=1}^{\nu \left(n\right)}\frac{p_r^{\alpha (1+a_r)}-1}{p_r^{\alpha }-1},$$ $\alpha \ne 0$.

ⓘ

Symbols:

${\sigma }_{\alpha }\left(n\right)$: sum of powers of divisors of a number, $\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers and $a_r$: positive exponent

A&S Ref:

24.3.3 I.C

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.3 and Ch.27

… ►

27.3.10 $$f(n)=\prod _{r=1}^{\nu \left(n\right)}{\left(f(p_r)\right)}^{a_r}.$$

ⓘ

Symbols:

$\nu \left(n\right)$: number of distinct primes dividing a number, $n$: positive integer, $p,p_1,\mathrm{\dots }$: prime numbers, $a_r$: positive exponent and $f(n)$: multiplicative function

Referenced by:

§27.20, §27.20

Permalink:

http://dlmf.nist.gov/27.3.E10

Encodings:

pMML, png, TeX

See also:

Annotations for §27.3 and Ch.27

22: 27.1 Special Notation

§27.1 Special Notation

… ► ►►►►

$d,k,m,n$	positive integers (unless otherwise indicated).
…
$p,p_1,p_2,\mathrm{\dots }$	prime numbers (or primes): integers ($>1$) with only two positive integer divisors, $1$ and the number itself.
…
$x,y$	real numbers.
…

23: 27.12 Asymptotic Formulas: Primes

§27.12 Asymptotic Formulas: Primes

… ►

Prime Number Theorem

… ►The number of such primes not exceeding $x$ is … ►There are infinitely many Carmichael numbers.

24: 27.2 Functions

… ►

§27.2(i) Definitions

… ►where $p_1,p_2,\mathrm{\dots },p_{\nu \left(n\right)}$ are the distinct prime factors of $n$, each exponent $a_r$ is positive, and $\nu \left(n\right)$ is the number of distinct primes dividing $n$. … ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … ► … ►

§27.2(ii) Tables

…

25: 24.5 Recurrence Relations

§24.5 Recurrence Relations

… ►

24.5.3 $$\sum _{k=0}^{n-1}\left(\genfrac{}{}{0pt}{}{n}{k}\right)B_k=0,$$ $n=2,3,\mathrm{\dots }$,

ⓘ

Symbols:

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

Referenced by:

§24.19(i)

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.5(i), §24.5 and Ch.24

… ►

24.5.5 $$\sum _{k=0}^n\left(\genfrac{}{}{0pt}{}{n}{k}\right)2^k{E}_{n-k}+E_n=2.$$

ⓘ

Symbols:

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

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.5(i), §24.5 and Ch.24

►

§24.5(ii) Other Identities

… ►

§24.5(iii) Inversion Formulas

…

26: 24.6 Explicit Formulas

§24.6 Explicit Formulas

… ►

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

ⓘ

Symbols:

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

Referenced by:

§24.6

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

… ►

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

ⓘ

Symbols:

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

Referenced by:

§24.6

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

… ►

24.6.9 $$B_n=\sum _{k=0}^n\frac{1}{k+1}\sum _{j=0}^k{(-1)}^j\left(\genfrac{}{}{0pt}{}{k}{j}\right)j^n,$$

ⓘ

Symbols:

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

Referenced by:

§24.6

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

… ►

24.6.12 $$E_{2n}=\sum _{k=0}^{2n}\frac{1}{2^k}\sum _{j=0}^k{(-1)}^j\left(\genfrac{}{}{0pt}{}{k}{j}\right){(1+2j)}^{2n}.$$

ⓘ

Symbols:

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

Referenced by:

§24.6, §24.6

Permalink:

http://dlmf.nist.gov/24.6.E12

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

27: 27.13 Functions

… ►

§27.13(i) Introduction

►Whereas multiplicative number theory is concerned with functions arising from prime factorization, additive number theory treats functions related to addition of integers. …The subsections that follow describe problems from additive number theory. … ►

§27.13(ii) Goldbach Conjecture

… ►

§27.13(iii) Waring’s Problem

…

28: 26.13 Permutations: Cycle Notation

… ►The Stirling cycle numbers of the first kind, denoted by $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$, count the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with exactly $k$ cycles. They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … ►The derangement number, $d(n)$, is the number of elements of ${𝔖}_n$ with no fixed points: … ►A permutation is even or odd according to the parity of the number of transpositions. …

29: 27.9 Quadratic Characters

§27.9 Quadratic Characters

►For an odd prime $p$, the Legendre symbol $(n|p)$ is defined as follows. … ►

27.9.2 $$(2|p)={(-1)}^{(p^2-1)/8}.$$

ⓘ

Symbols:

$(n|p)$: Legendre symbol and $p$: odd prime

Referenced by:

§27.9

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §27.9 and Ch.27

►If $p,q$ are distinct odd primes, then the quadratic reciprocity law states that … ►If an odd integer $P$ has prime factorization $P={\prod }_{r=1}^{\nu \left(n\right)}{p}_r^{a_r}$, then the Jacobi symbol $(n|P)$ is defined by $(n|P)={\prod }_{r=1}^{\nu \left(n\right)}{(n|p_r)}^{a_r}$, with $(n|1)=1$. …

30: 24.21 Software

… ►

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

…