Concrete Mathematics(2nd Edition) - A Note on Notation
2015-03-24 13:49
260 查看
lnx
natural logarithm: logex
lgx
binary logarithm: log2x
logx
common logarithm: log10x
⌊x⌋
floor: max{n | n≤x, integer n}
⌈x⌉
ceiling: min{n | n≥x, integer n}
xmody
remainder: x−y⌊x/y⌋
{x}
fractional part: xmod1
∑f(x)δx
indefinite summation
∑baf(x)δx
definite summation
xn−
falling factorial power: x!/(x−n)!
xn¯
rising factorial power: Γ(x+n)/Γ(x)
ni
subfactorial: n!/0!−n!/1!+⋯+(−1)nn!/n!
Rz
real part: x, if z=x+iy
Iz
imaginary part: y, if z=x+iy
Hn
harmonic number: 1/1+⋯+1/n
H(x)n
generalized harmonic number: 1/1x+⋯+1/nx
f(m)(z)
mth derivative of f at z
[nm]
Stirling cycle number (the “first kind”)
{nm}
Striling cycle number (the “second kind”)
⟨nm⟩
Eulerian number
⟨⟨nm⟩⟩
Second order Eulerian number
(am,…,a0)b
radix notation for ∑mk=0akbk
K(a1,…,an)
continuant polynomial
F(a,bc∣∣z)
hypergeometric function
#A
cardinality: number of elements in the set A
[zn]f(z)
coefficient of zn in f(z)
[α..β]
closed interval: the set {x | α≤x≤β}
[m=n]
1 if m=n, otherwise 0∗
[m∖n]
1 if m divides n, otherwise 0∗
[m∖∖n]
1 if m exactly divides n, otherwise 0∗
[m⊥n]
1 if m is relatively prime to n, otherwise 0∗
natural logarithm: logex
lgx
binary logarithm: log2x
logx
common logarithm: log10x
⌊x⌋
floor: max{n | n≤x, integer n}
⌈x⌉
ceiling: min{n | n≥x, integer n}
xmody
remainder: x−y⌊x/y⌋
{x}
fractional part: xmod1
∑f(x)δx
indefinite summation
∑baf(x)δx
definite summation
xn−
falling factorial power: x!/(x−n)!
xn¯
rising factorial power: Γ(x+n)/Γ(x)
ni
subfactorial: n!/0!−n!/1!+⋯+(−1)nn!/n!
Rz
real part: x, if z=x+iy
Iz
imaginary part: y, if z=x+iy
Hn
harmonic number: 1/1+⋯+1/n
H(x)n
generalized harmonic number: 1/1x+⋯+1/nx
f(m)(z)
mth derivative of f at z
[nm]
Stirling cycle number (the “first kind”)
{nm}
Striling cycle number (the “second kind”)
⟨nm⟩
Eulerian number
⟨⟨nm⟩⟩
Second order Eulerian number
(am,…,a0)b
radix notation for ∑mk=0akbk
K(a1,…,an)
continuant polynomial
F(a,bc∣∣z)
hypergeometric function
#A
cardinality: number of elements in the set A
[zn]f(z)
coefficient of zn in f(z)
[α..β]
closed interval: the set {x | α≤x≤β}
[m=n]
1 if m=n, otherwise 0∗
[m∖n]
1 if m divides n, otherwise 0∗
[m∖∖n]
1 if m exactly divides n, otherwise 0∗
[m⊥n]
1 if m is relatively prime to n, otherwise 0∗
相关文章推荐
- Note On <Programming Entity Framework 2nd Edition> -03
- Note On <Programming Entity Framework 2nd Edition> -02: How to Use SqlExpress Profiler 2.0
- Note On <Programming Entity Framework 2nd Edition> -01: How to Use LINQPad 4.5
- Note On <Programming Entity Framework 2nd Edition> -04
- Note On <Programming Entity Framework 2nd Edition> -05
- SQL Queries for Mere Mortals(R): A Hands-On Guide to Data Manipulation in SQL (2nd Edition)
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (3)
- Windows Azure Platform 2nd Edition Note
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (1)
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (1)
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (4)
- Note On <Beginning ASP.NET 3.5> Chp 10 & <Professional ASP.NET 3.5 SP1 Edition> Chp 19
- Autostart applications on S60 2nd Edition phones
- Windows Azure Platform 2nd Edition Note 2
- Learn Objectvie-C on the Mac 2nd Edition 笔记
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (2)
- [学习笔记]Thinking in Java (the 2nd edition) Study Note (4)
- 《Outlier Analysis 2nd Edition》- 1.2 The Data Model is Everything
- 架构师书单 2nd Edition
- Installing Zend Server Community Edition (CE) on Ubuntu 10.04.3 LTS