notation
Letters at the beginning of the alphabet stand for any number .
(
a
,
b
,
c
,
...
)
{\ displaystyle (a, b, c, \ ldots)}
Letters in the middle of the alphabet represent natural numbers .
(
i
,
j
,
m
,
n
,
...
)
{\ displaystyle (i, j, m, n, \ ldots)}
Letters at the end of the alphabet represent variables .
(
x
,
y
,
...
)
{\ displaystyle (x, y, \ ldots)}
The operator precedence applies ( point calculation before line calculation ): arithmetic operations of the second level (multiplication and division) bind more strongly than those of the first level (addition and subtraction) and arithmetic operations of the third level (extraction of the roots and exponentiation) are stronger than those of the second level.
It is the staple rule : standing operations in brackets, they will be executed first. If operations of the same level are consecutive without parentheses, the operations are carried out from left to right.
Basic arithmetic
Arithmetic operations
addition
a
+
b
=
c
{\ displaystyle a + b = c}
(Summand + summand = sum)
subtraction
a
-
b
=
c
{\ displaystyle ab = c}
(Minuend - Subtrahend = difference)
multiplication
a
⋅
b
=
c
{\ displaystyle a \ cdot b = c}
(Factor factor = product)
division
a
:
b
=
c
{\ displaystyle a: b = c}
(Dividend: divisor = quotient)
The division by zero is undefined.
Rules of brackets
a
+
(
b
+
c
)
=
a
+
b
+
c
{\ displaystyle a + (b + c) = a + b + c}
a
+
(
b
-
c
)
=
a
+
b
-
c
{\ displaystyle a + (bc) = a + bc}
a
-
(
b
+
c
)
=
a
-
b
-
c
{\ displaystyle a- (b + c) = abc}
a
-
(
b
-
c
)
=
a
-
b
+
c
{\ displaystyle a- (bc) = a-b + c}
Laws of Calculation
Associative Laws
a
+
(
b
+
c
)
=
(
a
+
b
)
+
c
{\ displaystyle a + \ left (b + c \ right) = \ left (a + b \ right) + c}
a
⋅
(
b
⋅
c
)
=
(
a
⋅
b
)
⋅
c
{\ displaystyle a \ cdot \ left (b \ cdot c \ right) = \ left (a \ cdot b \ right) \ cdot c}
Commutative laws
a
+
b
=
b
+
a
{\ displaystyle a + b = b + a \,}
a
⋅
b
=
b
⋅
a
{\ displaystyle a \ cdot b = b \ cdot a}
Distributive laws
a
⋅
(
b
+
c
)
=
a
⋅
b
+
a
⋅
c
{\ displaystyle a \ cdot \ left (b + c \ right) = a \ cdot b + a \ cdot c}
(
a
+
b
)
⋅
c
=
a
⋅
c
+
b
⋅
c
{\ displaystyle \ left (a + b \ right) \ cdot c = a \ cdot c + b \ cdot c}
Neutrality of and
0
{\ displaystyle 0}
1
{\ displaystyle 1}
a
+
0
=
0
+
a
=
a
{\ displaystyle a + 0 = 0 + a = a}
a
⋅
1
=
1
⋅
a
=
a
{\ displaystyle a \ cdot 1 = 1 \ cdot a = a}
Binomial formulas
(
a
+
b
)
2
=
a
2
+
2
⋅
a
⋅
b
+
b
2
{\ displaystyle (a + b) ^ {2} = a ^ {2} +2 \ cdot a \ cdot b + b ^ {2}}
(
a
-
b
)
2
=
a
2
-
2
⋅
a
⋅
b
+
b
2
{\ displaystyle (ab) ^ {2} = a ^ {2} -2 \ cdot a \ cdot b + b ^ {2}}
(
a
+
b
)
⋅
(
a
-
b
)
=
a
2
-
b
2
{\ displaystyle (a + b) \ cdot (ab) = a ^ {2} -b ^ {2}}
Fractions
Designations
definition
a
b
=
a
:
b
{\ displaystyle {\ frac {a} {b}} = a: b}
(Numerator: denominator)
The numerator and denominator are whole numbers, whereby the denominator cannot be zero.
Special cases
Trunk break:
a
=
1
{\ displaystyle a = 1}
Real break:
a
<
b
{\ displaystyle a <b}
Improper fraction:
a
>
b
{\ displaystyle a> b}
Pseudo fraction: with a whole number
a
=
b
⋅
c
{\ displaystyle a = b \ cdot c}
c
{\ displaystyle c}
Reversal break: and are swapped
a
{\ displaystyle a}
b
{\ displaystyle b}
Calculation rules
sign
-
a
b
=
a
-
b
=
-
a
b
{\ displaystyle {\ frac {-a} {b}} = {\ frac {a} {- b}} = - {\ frac {a} {b}}}
-
a
-
b
=
a
b
{\ displaystyle {\ frac {-a} {- b}} = {\ frac {a} {b}}}
Expand and shorten
a
b
=
a
⋅
c
b
⋅
c
{\ displaystyle {\ frac {a} {b}} = {\ frac {a \ cdot c} {b \ cdot c}}}
For
c
≠
0
{\ displaystyle c \ neq 0}
addition
a
b
+
c
d
=
a
⋅
d
+
c
⋅
b
b
⋅
d
{\ displaystyle {\ frac {a} {b}} + {\ frac {c} {d}} = {\ frac {a \ cdot d + c \ cdot b} {b \ cdot d}}}
subtraction
a
b
-
c
d
=
a
⋅
d
-
c
⋅
b
b
⋅
d
{\ displaystyle {\ frac {a} {b}} - {\ frac {c} {d}} = {\ frac {a \ cdot dc \ cdot b} {b \ cdot d}}}
multiplication
a
b
⋅
c
d
=
a
⋅
c
b
⋅
d
{\ displaystyle {\ frac {a} {b}} \ cdot {\ frac {c} {d}} = {\ frac {a \ cdot c} {b \ cdot d}}}
division
a
b
:
c
d
=
a
b
⋅
d
c
=
a
⋅
d
b
⋅
c
{\ displaystyle {\ frac {a} {b}}: {\ frac {c} {d}} = {\ frac {a} {b}} \ cdot {\ frac {d} {c}} = {\ frac {a \ cdot d} {b \ cdot c}}}
Percentage calculation
Definitions
p
%
=
p
100
{\ displaystyle p \, \% = {\ frac {p} {100}}}
(Percentage = percentage value: base value)
p
0
/
00
=
p
1
000
{\ displaystyle p \, {} ^ {0 \!} \! / \! _ {00} = {\ frac {p} {1 {\,} 000}}}
(Per mille rate = per mille value: basic value)
Percentages of frequently used parts
Share in the basic value
1
100
{\ displaystyle {\ frac {1} {100}}}
1
50
{\ displaystyle {\ frac {1} {50}}}
1
40
{\ displaystyle {\ frac {1} {40}}}
1
25th
{\ displaystyle {\ frac {1} {25}}}
1
20th
{\ displaystyle {\ frac {1} {20}}}
1
16
{\ displaystyle {\ frac {1} {16}}}
1
15th
{\ displaystyle {\ frac {1} {15}}}
1
12
{\ displaystyle {\ frac {1} {12}}}
1
11
{\ displaystyle {\ frac {1} {11}}}
1
10
{\ displaystyle {\ frac {1} {10}}}
percentage
1 %
2%
2.5%
4%
5%
6.25%
≈6.67%
≈8.33%
≈9.09%
10%
Share in the basic value
1
9
{\ displaystyle {\ frac {1} {9}}}
1
8th
{\ displaystyle {\ frac {1} {8}}}
1
7th
{\ displaystyle {\ frac {1} {7}}}
1
6th
{\ displaystyle {\ frac {1} {6}}}
1
5
{\ displaystyle {\ frac {1} {5}}}
1
4th
{\ displaystyle {\ frac {1} {4}}}
1
3
{\ displaystyle {\ frac {1} {3}}}
1
2
{\ displaystyle {\ frac {1} {2}}}
2
3
{\ displaystyle {\ frac {2} {3}}}
3
4th
{\ displaystyle {\ frac {3} {4}}}
percentage
≈11.11%
12.5%
≈14.29%
≈16.67%
20%
25%
≈33.33%
50%
≈66.67%
75%
Elementary arithmetic operations
power
Definitions
Natural exponent:
a
n
=
a
⋅
a
⋯
a
⏟
n
F.
a
k
t
O
r
e
n
{\ displaystyle a ^ {n} = \ underbrace {a \ cdot a \ dotsm a} _ {n \ \ mathrm {factors}}}
( Power = base to the power of exponent)
Negative exponent:
a
-
n
=
1
a
n
{\ displaystyle a ^ {- n} = {\ frac {1} {a ^ {n}}}}
Rational exponent:
x
=
a
m
/
n
⇔
x
n
=
a
m
{\ displaystyle x = a ^ {m / n} \; \ Leftrightarrow \; x ^ {n} = a ^ {m}}
Here is a nonnegative rational number and are natural numbers.
a
{\ displaystyle a}
m
,
n
{\ displaystyle m, n}
Special cases
a
0
=
1
{\ displaystyle a ^ {0} = 1}
for , see zero to the power of zero
a
≠
0
{\ displaystyle a \ neq 0}
0
n
=
0
{\ displaystyle 0 ^ {n} = 0}
For
n
≠
0
{\ displaystyle n \ neq 0}
Power laws
a
m
⋅
a
n
=
a
m
+
n
{\ displaystyle a ^ {m} \ cdot a ^ {n} = a ^ {m + n}}
a
m
a
n
=
a
m
-
n
{\ displaystyle {\ frac {a ^ {m}} {a ^ {n}}} = a ^ {mn}}
(
a
m
)
n
=
a
m
⋅
n
{\ displaystyle ({a ^ {m}}) ^ {n} = a ^ {m \ cdot n}}
a
n
⋅
b
n
=
(
a
⋅
b
)
n
{\ displaystyle a ^ {n} \ cdot b ^ {n} = (a \ cdot b) ^ {n}}
a
n
b
n
=
(
a
b
)
n
{\ displaystyle {\ frac {a ^ {n}} {b ^ {n}}} = \ left ({\ frac {a} {b}} \ right) ^ {n}}
The definition and calculation rules can be extended to real numbers.
root
definition
x
=
a
n
⇔
x
n
=
a
{\ displaystyle x = {\ sqrt [{n}] {a}} \; \ Leftrightarrow \; x ^ {n} = a}
( nth root , a is called radicand, n root exponent)
Here a nonnegative real number and a natural number is greater than one
a
{\ displaystyle a}
n
{\ displaystyle n}
Special cases
a
=
a
2
{\ displaystyle {\ sqrt {a}} = {\ sqrt [{2}] {a}}}
( Square root )
a
3
{\ displaystyle {\ sqrt [{3}] {a}}}
( Cube root )
Root Laws
a
n
=
a
1
n
{\ displaystyle {\ sqrt [{n}] {a}} = a ^ {\ frac {1} {n}}}
a
m
n
=
(
a
n
)
m
=
a
m
n
{\ displaystyle {\ sqrt [{n}] {a ^ {m}}} = ({\ sqrt [{n}] {a}}) ^ {m} = a ^ {\ frac {m} {n} }}
a
n
⋅
b
n
=
a
⋅
b
n
{\ displaystyle {\ sqrt [{n}] {a}} \ cdot {\ sqrt [{n}] {b}} = {\ sqrt [{n}] {a \ cdot b}}}
a
n
b
n
=
a
b
n
{\ displaystyle {{\ sqrt [{n}] {a}} \ over {\ sqrt [{n}] {b}}} = {\ sqrt [{n}] {a \ over b}}}
a
m
n
=
a
n
⋅
m
{\ displaystyle {\ sqrt [{n}] {\ sqrt [{m}] {a}}} = {\ sqrt [{n \ cdot m}] {a}}}
a
n
⋅
a
m
=
a
n
+
m
n
⋅
m
{\ displaystyle {\ sqrt [{n}] {a}} \ cdot {\ sqrt [{m}] {a}} = {\ sqrt [{n \ cdot m}] {a ^ {n + m}} }}
a
n
a
m
=
a
m
-
n
n
⋅
m
{\ displaystyle {\ frac {\ sqrt [{n}] {a}} {\ sqrt [{m}] {a}}} = {\ sqrt [{n \ cdot m}] {a ^ {mn}} }}
logarithm
definition
x
=
log
b
a
⇔
a
=
b
x
{\ displaystyle x = \ log _ {b} a \; \ Leftrightarrow \; a = b ^ {x}}
( Logarithm of number a to base b)
Where are positive real numbers.
a
,
b
{\ displaystyle a, b}
Special cases
log
2
a
=
lb
a
{\ displaystyle \ log _ {2} a = \ operatorname {lb} a}
( binary logarithm )
log
e
a
=
ln
a
{\ displaystyle \ log _ {e} a = \ ln a}
( natural logarithm )
log
10
a
=
lg
a
{\ displaystyle \ log _ {10} a = \ lg a}
( decadic logarithm )
log
b
1
=
0
{\ displaystyle \ log _ {b} 1 = 0}
log
b
b
=
1
{\ displaystyle \ log _ {b} b = 1}
Logarithmic Laws
log
b
(
a
⋅
c
)
=
log
b
a
+
log
b
c
{\ displaystyle \ log _ {b} (a \ cdot c) = \ log _ {b} a + \ log _ {b} c}
log
b
(
a
c
)
=
log
b
a
-
log
b
c
{\ displaystyle \ log _ {b} \ left ({\ frac {a} {c}} \ right) = \ log _ {b} a- \ log _ {b} c}
log
b
(
a
c
)
=
c
⋅
log
b
a
{\ displaystyle \ log _ {b} \ left (a ^ {c} \ right) = c \ cdot \ log _ {b} a}
log
b
a
=
log
c
a
log
c
b
{\ displaystyle \ log _ {b} a = {\ frac {\ log _ {c} a} {\ log _ {c} b}}}
Elementary functions
amount
definition
|
a
|
=
{
a
f
u
¨
r
a
>
0
0
f
u
¨
r
a
=
0
-
a
f
u
¨
r
a
<
0
{\ displaystyle | a | = {\ begin {cases} \; \; \, a & \ mathrm {f {\ ddot {u}} r} \ quad a> 0 \\\; \; \, 0 & \ mathrm { f {\ ddot {u}} r} \ quad a = 0 \\ - a & \ mathrm {f {\ ddot {u}} r} \ quad a <0 \\\ end {cases}}}
properties
|
a
|
=
0
⇔
a
=
0
{\ displaystyle | a | = 0 \; \ Leftrightarrow \; a = 0}
|
a
⋅
b
|
=
|
a
|
⋅
|
b
|
{\ displaystyle | a \ cdot b | = | a | \ cdot | b |}
|
a
+
b
|
≤
|
a
|
+
|
b
|
{\ displaystyle | a + b | \ leq | a | + | b |}
( Triangle inequality )
sign
definition
so-called
(
a
)
=
{
1
f
u
¨
r
a
>
0
0
f
u
¨
r
a
=
0
-
1
f
u
¨
r
a
<
0
{\ displaystyle \ operatorname {sgn} (a) = {\ begin {cases} \; \; \, 1 & \ mathrm {f {\ ddot {u}} r} \ quad a> 0 \\\; \; \ , 0 & \ mathrm {f {\ ddot {u}} r} \ quad a = 0 \\ - 1 & \ mathrm {f {\ ddot {u}} r} \ quad a <0 \\\ end {cases}} }
properties
so-called
(
a
)
=
a
|
a
|
{\ displaystyle \ operatorname {sgn} (a) = {\ frac {a} {| a |}}}
For
a
≠
0
{\ displaystyle a \ neq 0}
so-called
|
a
|
=
|
so-called
a
|
{\ displaystyle \ operatorname {sgn} | a | = | \ operatorname {sgn} a |}
so-called
(
a
⋅
b
)
=
so-called
(
a
)
⋅
so-called
(
b
)
{\ displaystyle \ operatorname {sgn} (a \ cdot b) = \ operatorname {sgn} (a) \ cdot \ operatorname {sgn} (b)}
Rounding up and down
Definitions
⌊
a
⌋
=
Max
{
k
∈
Z
∣
k
≤
a
}
{\ displaystyle \ lfloor a \ rfloor = \ max \ {k \ in \ mathbb {Z} \ mid k \ leq a \}}
(Rounding)
⌈
a
⌉
=
min
{
k
∈
Z
∣
k
≥
a
}
{\ displaystyle \ lceil a \ rceil = \ min \ {k \ in \ mathbb {Z} \ mid k \ geq a \}}
(Rounding up)
properties
⌊
⌊
a
⌋
⌋
=
⌈
⌊
a
⌋
⌉
=
⌊
a
⌋
{\ displaystyle {\ bigl \ lfloor} \ lfloor a \ rfloor {\ bigr \ rfloor} = {\ bigl \ lceil} \ lfloor a \ rfloor {\ bigr \ rceil} = \ lfloor a \ rfloor}
⌈
⌈
a
⌉
⌉
=
⌊
⌈
a
⌉
⌋
=
⌈
a
⌉
{\ displaystyle {\ bigl \ lceil} \ lceil a \ rceil {\ bigr \ rceil} = {\ bigl \ lfloor} \ lceil a \ rceil {\ bigr \ rfloor} = \ lceil a \ rceil}
⌊
a
⌋
+
⌊
b
⌋
≤
⌊
a
+
b
⌋
≤
⌊
a
⌋
+
⌊
b
⌋
+
1
{\ displaystyle \ lfloor a \ rfloor + \ lfloor b \ rfloor \ leq \ lfloor a + b \ rfloor \ leq \ lfloor a \ rfloor + \ lfloor b \ rfloor +1}
⌈
a
⌉
+
⌈
b
⌉
≥
⌈
a
+
b
⌉
≥
⌈
a
⌉
+
⌈
b
⌉
-
1
{\ displaystyle \ lceil a \ rceil + \ lceil b \ rceil \ geq \ lceil a + b \ rceil \ geq \ lceil a \ rceil + \ lceil b \ rceil -1}
Equations
Equivalent transformations
Solving equations
a
=
b
⇔
b
=
a
{\ displaystyle a = b \; \ Leftrightarrow \; b = a}
a
=
b
⇔
a
+
c
=
b
+
c
{\ displaystyle a = b \; \ Leftrightarrow \; a + c = b + c}
a
=
b
⇔
a
-
c
=
b
-
c
{\ displaystyle a = b \; \ Leftrightarrow \; ac = bc}
a
=
b
⇔
a
⋅
c
=
b
⋅
c
{\ displaystyle a = b \; \ Leftrightarrow \; a \ cdot c = b \ cdot c}
For
c
≠
0
{\ displaystyle c \ neq 0}
a
=
b
⇔
a
:
c
=
b
:
c
{\ displaystyle a = b \; \ Leftrightarrow \; a: c = b: c}
For
c
≠
0
{\ displaystyle c \ neq 0}
a
=
b
⇔
f
(
a
)
=
f
(
b
)
{\ displaystyle a = b \; \ Leftrightarrow \; f (a) = f (b)}
for every bijective function
f
{\ displaystyle f}
Linear equations
General form
a
⋅
x
=
b
{\ displaystyle a \ cdot x = b}
solutions
x
=
b
a
{\ displaystyle x = {\ frac {b} {a}}}
if
a
≠
0
{\ displaystyle a \ neq 0}
no solution if
a
=
0
,
b
≠
0
{\ displaystyle a = 0, b \ neq 0}
infinite solutions if
a
=
0
,
b
=
0
{\ displaystyle a = 0, b = 0}
Quadratic equations
General form
a
x
2
+
b
x
+
c
=
0
{\ displaystyle ax ^ {2} + bx + c = 0}
With
a
≠
0
{\ displaystyle a \ neq 0}
Discriminant
D.
=
b
2
-
4th
a
c
{\ displaystyle D = b ^ {2} -4ac}
solutions
x
1
,
2
=
-
b
±
b
2
-
4th
a
c
2
a
{\ displaystyle x_ {1,2} = {\ frac {-b \ pm {\ sqrt {b ^ {2} -4ac}}} {2a}}}
if
D.
>
0
{\ displaystyle D> 0}
x
=
-
b
2
a
{\ displaystyle x = - {\ frac {b} {2a}}}
if
D.
=
0
{\ displaystyle D = 0}
no real solution if
D.
<
0
{\ displaystyle D <0}
Square addition
a
x
2
+
b
x
+
c
=
a
(
x
+
b
2
a
)
2
+
(
c
-
b
2
4th
a
)
{\ displaystyle ax ^ {2} + bx + c = a \ left (x + {\ frac {b} {2a}} \ right) ^ {2} + \ left (c - {\ frac {b ^ {2} } {4a}} \ right)}
pq form
x
2
+
p
x
+
q
=
0
{\ displaystyle x ^ {2} + px + q = 0}
Discriminant
D.
=
p
2
4th
-
q
{\ displaystyle D = {\ frac {p ^ {2}} {4}} - q}
solutions
x
1
,
2
=
-
p
2
±
p
2
4th
-
q
{\ displaystyle x_ {1,2} = - {\ frac {p} {2}} \ pm {\ sqrt {{\ frac {p ^ {2}} {4}} - q}}}
if
D.
>
0
{\ displaystyle D> 0}
x
=
-
p
2
{\ displaystyle x = - {\ frac {p} {2}}}
if
D.
=
0
{\ displaystyle D = 0}
no real solution if
D.
<
0
{\ displaystyle D <0}
Theorem of Vieta
p
=
-
(
x
1
+
x
2
)
{\ displaystyle p = - (x_ {1} + x_ {2})}
q
=
x
1
⋅
x
2
{\ displaystyle q = x_ {1} \ cdot x_ {2}}
Algebraic equations
General form
a
n
x
n
+
a
n
-
1
x
n
-
1
+
a
n
-
2
x
n
-
2
+
⋯
+
a
2
x
2
+
a
1
x
1
+
a
0
=
0
{\ displaystyle a_ {n} x ^ {n} + a_ {n-1} x ^ {n-1} + a_ {n-2} x ^ {n-2} + \ dotsb + a_ {2} x ^ {2} + a_ {1} x ^ {1} + a_ {0} = 0}
solutions
x
1
,
...
,
x
n
{\ displaystyle x_ {1}, \ ldots, x_ {n}}
as complex solutions, not necessarily different ( fundamental theorem of algebra )
Decomposition into linear factors
a
n
(
x
-
x
1
)
(
x
-
x
2
)
⋯
(
x
-
x
n
)
=
0
{\ displaystyle a_ {n} (x-x_ {1}) (x-x_ {2}) \ dotsm (x-x_ {n}) = 0}
Polynomial division
p
(
x
)
=
s
(
x
)
q
(
x
)
+
r
(
x
)
{\ displaystyle p (x) = s (x) q (x) + r (x)}
in which
Degree
p
≥
Degree
q
{\ displaystyle \ operatorname {grad} p \ geq \ operatorname {grad} q}
p
(
x
)
q
(
x
)
=
s
(
x
)
+
r
(
x
)
q
(
x
)
{\ displaystyle {\ frac {p (x)} {q (x)}} = s (x) + {\ frac {r (x)} {q (x)}}}
in which
Degree
q
≥
0
{\ displaystyle \ operatorname {grad} q \ geq 0}
Inequalities
Equivalent transformations
Solving inequalities
a
<
b
⇔
b
>
a
{\ displaystyle a <b \; \ Leftrightarrow \; b> a}
a
<
b
⇔
a
+
c
<
b
+
c
{\ displaystyle a <b \; \ Leftrightarrow \; a + c <b + c}
a
<
b
⇔
a
-
c
<
b
-
c
{\ displaystyle a <b \; \ Leftrightarrow \; ac <bc}
a
<
b
⇔
{
a
⋅
c
<
b
⋅
c
if
c
>
0
a
⋅
c
>
b
⋅
c
if
c
<
0
{\ displaystyle a <b \; \ Leftrightarrow \; {\ begin {cases} a \ cdot c <b \ cdot c & {\ text {falls}} ~ c> 0 \\ a \ cdot c> b \ cdot c & { \ text {falls}} ~ c <0 \ end {cases}}}
a
<
b
⇔
{
a
:
c
<
b
:
c
if
c
>
0
a
:
c
>
b
:
c
if
c
<
0
{\ displaystyle a <b \; \ Leftrightarrow \; {\ begin {cases} a: c <b: c & {\ text {falls}} ~ c> 0 \\ a: c> b: c & {\ text {if }} ~ c <0 \ end {cases}}}
a
<
b
⇔
{
f
(
a
)
<
f
(
b
)
if
f
is strictly monotonically increasing bijectively
f
(
a
)
>
f
(
b
)
if
f
bijective is strictly monotonically decreasing
{\ displaystyle a <b \; \ Leftrightarrow \; {\ begin {cases} f (a) <f (b) & {\ text {if}} ~ f ~ {\ text {bijectively strictly monotonically increasing}} \ \ f (a)> f (b) & {\ text {falls}} ~ f ~ {\ text {bijective is strictly monotonically decreasing}} \ end {cases}}}
The transformation rules also apply to .
≤
,
≥
{\ displaystyle \ leq, \ geq}
Special inequalities
Triangle inequality
|
a
+
b
|
≤
|
a
|
+
|
b
|
{\ displaystyle | a + b | \ leq | a | + | b |}
for all
a
,
b
{\ displaystyle a, b}
Bernoulli's inequality
(
1
+
a
)
n
≥
1
+
a
⋅
n
{\ displaystyle (1 + a) ^ {n} \ geq 1 + a \ cdot n}
for and
a
≥
-
1
{\ displaystyle a \ geq -1}
n
=
0
,
1
,
2
,
...
{\ displaystyle n = 0,1,2, \ ldots}
Young's inequality
a
⋅
b
≤
a
p
p
+
b
q
q
{\ displaystyle a \ cdot b \ leq {\ frac {a ^ {p}} {p}} + {\ frac {b ^ {q}} {q}}}
for and with
a
,
b
≥
0
{\ displaystyle a, b \ geq 0}
p
,
q
>
1
{\ displaystyle p, q> 1}
1
p
+
1
q
=
1
{\ displaystyle {\ tfrac {1} {p}} + {\ tfrac {1} {q}} = 1}
Inequalities in means
Inequality of the arithmetic and geometric mean
a
1
⋅
...
⋅
a
n
n
≤
1
n
(
a
1
+
...
+
a
n
)
{\ displaystyle {\ sqrt [{n}] {a_ {1} \ cdot \ ldots \ cdot a_ {n}}} \ leq {\ frac {1} {n}} (a_ {1} + \ ldots + a_ {n})}
for and
a
1
,
...
,
a
n
≥
0
{\ displaystyle a_ {1}, \ ldots, a_ {n} \ geq 0}
n
=
2
,
3
,
...
{\ displaystyle n = 2,3, \ ldots}
Inequality of harmonic and geometric mean
n
1
a
1
+
...
+
1
a
n
≤
a
1
⋅
...
⋅
a
n
n
{\ displaystyle {\ frac {n} {{\ frac {1} {a_ {1}}} + \ ldots + {\ frac {1} {a_ {n}}}}} \ leq {\ sqrt [{n }] {a_ {1} \ cdot \ ldots \ cdot a_ {n}}}}
for and
a
1
,
...
,
a
n
>
0
{\ displaystyle a_ {1}, \ ldots, a_ {n}> 0}
n
=
2
,
3
,
...
{\ displaystyle n = 2,3, \ ldots}
Complex numbers
Algebraic form
presentation
z
=
a
+
b
⋅
i
{\ displaystyle z = a + b \ cdot \ mathrm {i}}
with real part , imaginary part and the imaginary unit
a
{\ displaystyle a}
b
{\ displaystyle b}
i
{\ displaystyle \ mathrm {i}}
z
¯
=
a
-
b
⋅
i
{\ displaystyle {\ bar {z}} = from \ cdot \ mathrm {i}}
( Complex conjugation )
Powers of imaginary unity
i
0
=
1
{\ displaystyle \ mathrm {i} ^ {0} = 1}
i
1
=
i
{\ displaystyle \ mathrm {i} ^ {1} = \ mathrm {i}}
i
2
=
-
1
{\ displaystyle \ mathrm {i} ^ {2} = - 1}
i
3
=
-
i
{\ displaystyle \ mathrm {i} ^ {3} = - \ mathrm {i}}
General for :
n
∈
Z
{\ displaystyle n \ in \ mathbb {Z}}
i
4th
n
=
1
{\ displaystyle \ mathrm {i} ^ {4n} = 1}
i
4th
n
+
1
=
i
{\ displaystyle \ mathrm {i} ^ {4n + 1} = \ mathrm {i}}
i
4th
n
+
2
=
-
1
{\ displaystyle \ mathrm {i} ^ {4n + 2} = - 1}
i
4th
n
+
3
=
-
i
{\ displaystyle \ mathrm {i} ^ {4n + 3} = - \ mathrm {i}}
Arithmetic operations
(
a
+
i
b
)
+
(
c
+
i
d
)
=
(
a
+
c
)
+
i
(
b
+
d
)
{\ displaystyle (a + \ mathrm {i} b) + (c + \ mathrm {i} d) = (a + c) + \ mathrm {i} (b + d)}
(
a
+
i
b
)
-
(
c
+
i
d
)
=
(
a
-
c
)
+
i
(
b
-
d
)
{\ displaystyle (a + \ mathrm {i} b) - (c + \ mathrm {i} d) = (ac) + \ mathrm {i} (bd)}
(
a
+
i
b
)
⋅
(
c
+
i
d
)
=
a
c
-
b
d
+
i
(
a
d
+
b
c
)
{\ displaystyle (a + \ mathrm {i} b) \ cdot (c + \ mathrm {i} d) = ac-bd + \ mathrm {i} (ad + bc)}
(
a
+
i
b
)
:
(
c
+
i
d
)
=
a
c
+
b
d
c
2
+
d
2
+
i
b
c
-
a
d
c
2
+
d
2
{\ displaystyle (a + \ mathrm {i} b) :( c + \ mathrm {i} d) = {\ frac {ac + bd} {c ^ {2} + d ^ {2}}} + \ mathrm {i } \, {\ frac {bc-ad} {c ^ {2} + d ^ {2}}}}
For
c
2
+
d
2
≠
0
{\ displaystyle c ^ {2} + d ^ {2} \ neq 0}
Polar shape
presentation
z
=
r
⋅
(
cos
(
φ
)
+
i
⋅
sin
(
φ
)
)
{\ displaystyle z = r \ cdot (\ cos (\ varphi) + \ mathrm {i} \ cdot \ sin (\ varphi))}
with the amount and the argument
r
{\ displaystyle r}
φ
{\ displaystyle \ varphi}
amount
r
=
|
z
|
=
z
⋅
z
¯
=
a
2
+
b
2
{\ displaystyle r = | z | = {\ sqrt {z \ cdot {\ bar {z}}}} = {\ sqrt {a ^ {2} + b ^ {2}}}}
argument
φ
=
{
arctan
b
a
f
u
¨
r
a
>
0
arctan
b
a
+
π
f
u
¨
r
a
<
0
,
b
≥
0
arctan
b
a
-
π
f
u
¨
r
a
<
0
,
b
<
0
π
/
2
f
u
¨
r
a
=
0
,
b
>
0
-
π
/
2
f
u
¨
r
a
=
0
,
b
<
0
{\ displaystyle \ varphi = {\ begin {cases} \ arctan {\ frac {b} {a}} & \ mathrm {f {\ ddot {u}} r} \ a> 0 \\\ arctan {\ frac { b} {a}} + \ pi & \ mathrm {f {\ ddot {u}} r} \ a <0, b \ geq 0 \\\ arctan {\ frac {b} {a}} - \ pi & \ mathrm {f {\ ddot {u}} r} \ a <0, b <0 \\\ pi / 2 & \ mathrm {f {\ ddot {u}} r} \ a = 0, b> 0 \\ - \ pi / 2 & \ mathrm {f {\ ddot {u}} r} \ a = 0, b <0 \ end {cases}}}
or
φ
=
{
arccos
a
r
f
u
¨
r
b
≥
0
arccos
(
-
a
r
)
-
π
f
u
¨
r
b
<
0
{\ displaystyle \ varphi = {\ begin {cases} \ arccos {\ frac {a} {r}} & \ mathrm {f {\ ddot {u}} r} \ b \ geq 0 \\\ arccos \ left ( - {\ frac {a} {r}} \ right) - \ pi & \ mathrm {f {\ ddot {u}} r} \ b <0 \ end {cases}}}
Exponential form
presentation
z
=
r
⋅
e
i
φ
{\ displaystyle z = r \ cdot e ^ {\ mathrm {i} \ varphi}}
with Euler's number
e
{\ displaystyle e}
e
i
φ
=
cos
φ
+
i
sin
φ
{\ displaystyle e ^ {\ mathrm {i} \ varphi} = \ cos \ varphi + \ mathrm {i} \, \ sin \ varphi}
( Euler's formula )
Conversion formulas
sin
φ
=
e
i
φ
-
e
-
i
φ
2
i
{\ displaystyle \ sin \ varphi = {\ frac {e ^ {\ mathrm {i} \ varphi} -e ^ {- \ mathrm {i} \ varphi}} {2 \ mathrm {i}}}}
cos
φ
=
e
i
φ
+
e
-
i
φ
2
{\ displaystyle \ cos \ varphi = {\ frac {e ^ {\ mathrm {i} \ varphi} + e ^ {- \ mathrm {i} \ varphi}} {2}}}
Arithmetic operations
(
r
⋅
e
i
φ
)
±
(
s
⋅
e
i
ψ
)
=
r
2
+
s
2
±
2
r
s
cos
(
φ
-
ψ
)
⋅
e
i
atan2
(
r
sin
φ
±
s
sin
ψ
,
r
cos
φ
±
s
cos
ψ
)
{\ displaystyle (r \ cdot e ^ {\ mathrm {i} \ varphi}) \ pm (s \ cdot e ^ {\ mathrm {i} \ psi}) = {\ sqrt {r ^ {2} + s ^ {2} \ pm 2rs \ cos (\ varphi - \ psi)}} \ cdot e ^ {\ mathrm {i} \ operatorname {atan2} \ left (r \ sin \ varphi \ pm s \ sin \ psi, r \ cos \ varphi \ pm s \ cos \ psi \ right)}}
(
r
⋅
e
i
φ
)
⋅
(
s
⋅
e
i
ψ
)
=
(
r
⋅
s
)
⋅
e
i
(
φ
+
ψ
)
{\ displaystyle (r \ cdot e ^ {\ mathrm {i} \ varphi}) \ cdot (s \ cdot e ^ {\ mathrm {i} \ psi}) = (r \ cdot s) \ cdot e ^ {\ mathrm {i} (\ varphi + \ psi)}}
(
r
⋅
e
i
φ
)
:
(
s
⋅
e
i
ψ
)
=
(
r
:
s
)
⋅
e
i
(
φ
-
ψ
)
{\ displaystyle (r \ cdot e ^ {\ mathrm {i} \ varphi}) :( s \ cdot e ^ {\ mathrm {i} \ psi}) = (r: s) \ cdot e ^ {\ mathrm { i} (\ varphi - \ psi)}}
Potencies
(
r
⋅
e
i
φ
)
n
=
r
n
⋅
e
i
n
φ
{\ displaystyle (r \ cdot e ^ {\ mathrm {i} \ varphi}) ^ {n} = r ^ {n} \ cdot e ^ {\ mathrm {i} n \ varphi}}
root
x
n
=
1
⇔
x
=
e
2
π
i
k
/
n
{\ displaystyle x ^ {n} = 1 \, \ Leftrightarrow \, x = e ^ {2 \ pi \ mathrm {i} k / n}}
for ( roots of unity )
k
=
0
,
1
,
...
,
n
-
1
{\ displaystyle k = 0.1, \ dots, n-1}
x
n
=
z
⇔
x
=
|
z
|
n
⋅
e
(
i
bad
(
z
)
+
2
π
i
k
)
/
n
{\ displaystyle x ^ {n} = z \, \ Leftrightarrow \, x = {\ sqrt [{n}] {| z |}} \ cdot e ^ {(\ mathrm {i} \ arg (z) +2 \ pi \ mathrm {i} k) / n}}
For
k
=
0
,
1
,
...
,
n
-
1
{\ displaystyle k = 0.1, \ dots, n-1}
Molecular formulas
Calculation rules
∑
i
=
1
n
c
=
n
⋅
c
{\ displaystyle \ sum _ {i = 1} ^ {n} c = n \ cdot c}
∑
i
=
m
n
c
=
(
n
-
m
+
1
)
⋅
c
{\ displaystyle \ sum _ {i = m} ^ {n} c = (n-m + 1) \ cdot c}
∑
i
=
m
n
c
⋅
a
i
=
c
⋅
∑
i
=
m
n
a
i
{\ displaystyle \ sum _ {i = m} ^ {n} c \ cdot a_ {i} = c \ cdot \ sum _ {i = m} ^ {n} a_ {i}}
∑
i
=
m
n
(
a
i
+
b
i
)
=
∑
i
=
m
n
a
i
+
∑
i
=
m
n
b
i
{\ displaystyle \ sum _ {i = m} ^ {n} (a_ {i} + b_ {i}) = \ sum _ {i = m} ^ {n} a_ {i} + \ sum _ {i = m} ^ {n} b_ {i}}
∑
i
=
m
n
a
i
=
∑
i
=
m
-
r
n
-
r
a
i
+
r
{\ displaystyle \ sum _ {i = m} ^ {n} a_ {i} = \ sum _ {i = mr} ^ {nr} a_ {i + r}}
∑
i
=
1
n
(
a
i
-
a
i
-
1
)
=
a
n
-
a
0
{\ displaystyle \ sum _ {i = 1} ^ {n} (a_ {i} -a_ {i-1}) = a_ {n} -a_ {0}}
( Telescope sum )
Arithmetic series
∑
i
=
1
n
i
=
n
(
n
+
1
)
2
{\ displaystyle \ sum _ {i = 1} ^ {n} i = {\ frac {n (n + 1)} {2}}}
( Gaussian empirical formula )
Geometric series
∑
i
=
0
n
k
i
=
1
-
k
n
+
1
1
-
k
{\ displaystyle \ sum _ {i = 0} ^ {n} k ^ {i} = {\ frac {1-k ^ {n + 1}} {1-k}}}
Power sums
∑
i
=
1
n
i
2
=
n
(
n
+
1
)
(
2
n
+
1
)
6th
{\ displaystyle \ sum _ {i = 1} ^ {n} i ^ {2} = {\ frac {n (n + 1) (2n + 1)} {6}}}
∑
i
=
1
n
i
3
=
n
2
(
n
+
1
)
2
4th
{\ displaystyle \ sum _ {i = 1} ^ {n} i ^ {3} = {\ frac {n ^ {2} (n + 1) ^ {2}} {4}}}
For further power sums see Faulhaber's formula .
Combinatorial Sums
Binomial theorem
(
a
+
b
)
n
=
∑
k
=
0
n
(
n
k
)
a
n
-
k
b
k
{\ displaystyle (a + b) ^ {n} = \ sum _ {k = 0} ^ {n} {n \ choose k} a ^ {nk} b ^ {k}}
Multinomial theorem
(
∑
i
=
1
k
a
i
)
n
=
∑
n
1
+
...
+
n
k
=
n
(
n
n
1
,
...
,
n
k
)
⋅
a
1
n
1
⋅
a
2
n
2
⋯
a
k
n
k
{\ displaystyle \ left (\ sum _ {i = 1} ^ {k} a_ {i} \ right) ^ {n} = \ sum _ {n_ {1} + \ ldots + n_ {k} = n} { n \ choose n_ {1}, \ ldots, n_ {k}} \, \ cdot \, a_ {1} ^ {n_ {1}} \ cdot a_ {2} ^ {n_ {2}} \ cdots a_ { k} ^ {n_ {k}}}
Inequalities in sums
Cauchy-Schwarz inequality
(
∑
i
=
1
n
a
i
⋅
b
i
)
2
≤
(
∑
i
=
1
n
a
i
2
)
⋅
(
∑
i
=
1
n
b
i
2
)
{\ displaystyle \ left (\ sum _ {i = 1} ^ {n} a_ {i} \ cdot b_ {i} \ right) ^ {2} \ leq \ left (\ sum _ {i = 1} ^ { n} a_ {i} ^ {2} \ right) \ cdot \ left (\ sum _ {i = 1} ^ {n} b_ {i} ^ {2} \ right)}
for everyone and
a
1
,
...
,
a
n
{\ displaystyle a_ {1}, \ ldots, a_ {n}}
b
1
,
...
,
b
n
{\ displaystyle b_ {1}, \ ldots, b_ {n}}
Chebyshev inequalities
n
⋅
(
∑
i
=
1
n
a
i
⋅
b
i
)
≥
(
∑
i
=
1
n
a
i
)
⋅
(
∑
i
=
1
n
b
i
)
{\ displaystyle n \ cdot \ left (\ sum _ {i = 1} ^ {n} a_ {i} \ cdot b_ {i} \ right) \ geq \ left (\ sum _ {i = 1} ^ {n } a_ {i} \ right) \ cdot \ left (\ sum _ {i = 1} ^ {n} b_ {i} \ right)}
for everyone and
a
1
≥
...
≥
a
n
{\ displaystyle a_ {1} \ geq \ ldots \ geq a_ {n}}
b
1
≥
...
≥
b
n
{\ displaystyle b_ {1} \ geq \ ldots \ geq b_ {n}}
n
⋅
(
∑
i
=
1
n
a
i
⋅
b
i
)
≤
(
∑
i
=
1
n
a
i
)
⋅
(
∑
i
=
1
n
b
i
)
{\ displaystyle n \ cdot \ left (\ sum _ {i = 1} ^ {n} a_ {i} \ cdot b_ {i} \ right) \ leq \ left (\ sum _ {i = 1} ^ {n } a_ {i} \ right) \ cdot \ left (\ sum _ {i = 1} ^ {n} b_ {i} \ right)}
for everyone and
a
1
≥
...
≥
a
n
{\ displaystyle a_ {1} \ geq \ ldots \ geq a_ {n}}
b
1
≤
...
≤
b
n
{\ displaystyle b_ {1} \ leq \ ldots \ leq b_ {n}}
Minkowski inequality
(
∑
i
=
1
n
|
a
i
+
b
i
|
p
)
1
/
p
≤
(
∑
i
=
1
n
|
a
i
|
p
)
1
/
p
+
(
∑
i
=
1
n
|
b
i
|
p
)
1
/
p
{\ displaystyle \ left (\ sum _ {i = 1} ^ {n} | a_ {i} + b_ {i} | ^ {p} \ right) ^ {1 / p} \ leq \ left (\ sum _ {i = 1} ^ {n} | a_ {i} | ^ {p} \ right) ^ {1 / p} + \ left (\ sum _ {i = 1} ^ {n} | b_ {i} | ^ {p} \ right) ^ {1 / p}}
for everyone and as well
a
1
,
...
,
a
n
{\ displaystyle a_ {1}, \ ldots, a_ {n}}
b
1
,
...
,
b
n
{\ displaystyle b_ {1}, \ ldots, b_ {n}}
p
≥
1
{\ displaystyle p \ geq 1}
Holder's inequality
∑
i
=
1
n
|
a
i
⋅
b
i
|
≤
(
∑
i
=
1
n
|
a
i
|
p
)
1
/
p
⋅
(
∑
i
=
1
n
|
b
i
|
q
)
1
/
q
{\ displaystyle \ sum _ {i = 1} ^ {n} | a_ {i} \ cdot b_ {i} | \ leq \ left (\ sum _ {i = 1} ^ {n} | a_ {i} | ^ {p} \ right) ^ {1 / p} \ cdot \ left (\ sum _ {i = 1} ^ {n} | b_ {i} | ^ {q} \ right) ^ {1 / q}}
for everyone and as well as with
a
1
,
...
,
a
n
{\ displaystyle a_ {1}, \ ldots, a_ {n}}
b
1
,
...
,
b
n
{\ displaystyle b_ {1}, \ ldots, b_ {n}}
p
,
q
≥
1
{\ displaystyle p, q \ geq 1}
1
p
+
1
q
=
1
{\ displaystyle {\ tfrac {1} {p}} + {\ tfrac {1} {q}} = 1}
Jensen's inequality
f
(
∑
i
=
1
n
a
i
⋅
b
i
)
≤
∑
i
=
1
n
a
i
⋅
f
(
b
i
)
{\ displaystyle f \ left (\ sum _ {i = 1} ^ {n} a_ {i} \ cdot b_ {i} \ right) \ leq \ sum _ {i = 1} ^ {n} a_ {i} \ cdot f (b_ {i})}
for every convex function , with and all
f
{\ displaystyle f}
a
1
,
...
,
a
n
≥
0
{\ displaystyle a_ {1}, \ ldots, a_ {n} \ geq 0}
a
1
+
...
+
a
n
=
1
{\ displaystyle a_ {1} + \ ldots + a_ {n} = 1}
b
1
,
...
,
b
n
{\ displaystyle b_ {1}, \ ldots, b_ {n}}
literature
<img src="https://de.wikipedia.org/wiki/Special:CentralAutoLogin/start?type=1x1" alt="" title="" width="1" height="1" style="border: none; position: absolute;">