cash app phone number %2B1%28888%E2%80%92481%E2%80%924477%29

SearchAdvancedHelp

(0.003 seconds)

21—30 of 837 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.12 Asymptotic Formulas: Primes

§27.12 Asymptotic Formulas: Primes

… ►

Prime Number Theorem

… ►The largest known prime (2018) is the Mersenne prime $2^{82,589,933}-1$. … ►There are infinitely many Carmichael numbers.

23: 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.
…

24: 24.6 Explicit Formulas

§24.6 Explicit Formulas

►The identities in this section hold for $n=1,2,\mathrm{\dots }$. … ►

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.5 $$E_{2n}=\frac{1}{2^{n-1}}\sum _{k=0}^{n-1}{(-1)}^{n-k}{(n-k)}^{2n}\sum _{j=0}^k\left(\genfrac{}{}{0pt}{}{2n-2j}{k-j}\right)2^j,$$

ⓘ

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.E5

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

25: 27.13 Functions

… ►

§27.13(i) Introduction

… ►

§27.13(ii) Goldbach Conjecture

… ►

§27.13(iii) Waring’s Problem

… ►For a given integer $k\ge 2$ the function $r_k\left(n\right)$ is defined as the number of solutions of the equation … ►Hence $r_2\left(5\right)=8$ because both divisors, $1$ and $5$, are congruent to $1(mod4)$. …

26: 24.20 Tables

§24.20 Tables

►Abramowitz and Stegun (1964, Chapter 23) includes exact values of ${\sum }_{k=1}^m{k}^n$, $m=1(1)100$, $n=1(1)10$; ${\sum }_{k=1}^{\mathrm{\infty }}{k}^{-n}$, ${\sum }_{k=1}^{\mathrm{\infty }}{(-1)}^{k-1}{k}^{-n}$, ${\sum }_{k=0}^{\mathrm{\infty }}{(2k+1)}^{-n}$, $n=1,2,\mathrm{\dots }$, 20D; ${\sum }_{k=0}^{\mathrm{\infty }}{(-1)}^k{(2k+1)}^{-n}$, $n=1,2,\mathrm{\dots }$, 18D. ►Wagstaff (1978) gives complete prime factorizations of $N_n$ and $E_n$ for $n=20(2)60$ and $n=8(2)42$, respectively. In Wagstaff (2002) these results are extended to $n=60(2)152$ and $n=40(2)88$, respectively, with further complete and partial factorizations listed up to $n=300$ and $n=200$, respectively. …

27: 24.9 Inequalities

§24.9 Inequalities

►Except where otherwise noted, the inequalities in this section hold for $n=1,2,\mathrm{\dots }$. … ►

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)–(24.9.5) hold for $\frac{1}{2}>x>0$. … ►(24.9.6)–(24.9.7) hold for $n=2,3,\mathrm{\dots }$. …

28: 27.9 Quadratic Characters

§27.9 Quadratic Characters

►For an odd prime $p$, the Legendre symbol $(n|p)$ is defined as follows. …If $p$ does not divide $n$, then $(n|p)$ has the value $1$ when the quadratic congruence $x^2\equiv n(modp)$ has a solution, and the value $-1$ when this congruence has no solution. … ►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$. …

29: 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.8 $$\ln \left(\cos z\right)=\sum _{n=1}^{\mathrm{\infty }}\frac{{(-1)}^n{2}^{2n-1}(2^{2n}-1)B_{2n}}{n(2n)!}{z}^{2n},$$ ,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $\cos z$: cosine function, $!$: factorial (as in $n!$), $\ln z$: principal branch of logarithm function, $n$: integer and $z$: complex variable

A&S Ref:

4.3.72

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

►

4.19.9 $$\ln \left(\frac{\tan z}{z}\right)=\sum _{n=1}^{\mathrm{\infty }}\frac{{(-1)}^{n-1}{2}^{2n}(2^{2n-1}-1)B_{2n}}{n(2n)!}{z}^{2n},$$ .

ⓘ

Symbols:

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

A&S Ref:

4.3.73

Referenced by:

§4.19, §4.33

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §4.19 and Ch.4

30: 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. …