Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Exercise sheet 5/latex
\setcounter{section}{5}
\subtitle {Exercises}
\inputexercise
{}
{
Determine which of the two rational numbers
\mathcor {} {p} {and} {q} {}
is larger:
\mathdisp {p= \frac{573}{-1234} \text{ and } q = \frac{-2007}{4322}} { . }
\inputexercise
{}
{
There are two glasses on the table, in one there is red wine, in the other there is white wine, the same amount. Now a small empty glass is immersed into the red wine glass completely and the content is put into the white wine glass and mixed with its content
\extrabracket {in particular, there is enough space there} {} {.}
After this, the small glass is immersed into the white wine glass completely and the content is put into the red wine glass. In the end, is there more red wine in the red wine glass than white wine in the white whine glass?
\inputexercise
{}
{
A Bahncard $25$ costs $62$ Euros and allows for one year to save $25$ percentage of the standard price for the travels. A Bahncard $50$ costs $255$ Euros and allows for one year to save $50$ percentage of the standard price for the travels. Determine for which standard price no Bahncard, the Bahncard $25$ or the Bahncard $50$ is the best option.
\inputexercise
{}
{
Two bicyclists,
\mathcor {} {A} {and} {B} {,}
drive on their bikes along a street. $A$ makes $40$ pedal turnings per minute, has a gear ratio of pedal to back wheel of $1$ to $6$ and tyres with a radius of $39$ centimeter.
$B$ needs $2$ seconds for one pedal turning, has a gear ratio of pedal to back wheel of $1$ to $7$ and tyres with a radius of $45$ centimeter.
Who is driving faster?
\inputexercise
{}
{
Show that in an
ordered field
the following properties hold.
\enumerationten {
\mathrelationchain
{\relationchain
{1
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{-a
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{a-b
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{-a
}
{ \leq }{-b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{d
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{a +c
}
{ \geq }{b+d
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \geq }{bc
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \leq }{bc
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ \geq }{0
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{c
}
{ \geq }{d
}
{ \geq }{0
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ac
}
{ \geq }{bd
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ab
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{a
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \leq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
imply
\mathrelationchain
{\relationchain
{ab
}
{ \geq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
On the recently discovered planet Trigeno there lives a species which has some ability to calculate. They use like us the rational numbers with \quotationshort{our}{} addition and multiplication. They also use a kind of \quotationshort{ordering}{} on the rational numbers, denoted by $\succeq$. This trigenometric ordering coincides with our ordering as long as both numbers are$\neq 0$. However, they put
\mathrelationchaindisplay
{\relationchain
{0
}
{ \succeq} {x
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
for every rational number $x$. The well-known Ethnomathematician Dr. Eisenbeis thinks that this is related to the fact that they worship the number $0$.
Show that $\succeq$ fulfils the following properties.
\enumerationfour {For any two elements
\mathrelationchain
{\relationchain
{a,b
}
{ \in }{\Q
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
either
\mathrelationchain
{\relationchain
{a
}
{ \succ }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{a
}
{ = }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{b
}
{ \succ }{a
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
} {From
\mathrelationchain
{\relationchain
{a
}
{ \succeq }{b
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{b
}
{ \succeq }{c
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we get
\mathrelationchain
{\relationchain
{a
}
{ \succeq }{c
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {for arbitrary
\mathrelationchainb
{\relationchainb
{ a , b , c
}
{ \in }{ \Q
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}} {} {.}
} {From
\mathrelationchain
{\relationchain
{ a
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{ b
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we get
\mathrelationchain
{\relationchain
{ a + b
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {From
\mathrelationchain
{\relationchain
{ a
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and
\mathrelationchain
{\relationchain
{ b
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we get
\mathrelationchain
{\relationchain
{ a b
}
{ \succeq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
Which property of an ordered field does \mathl{(\Q, \succeq)}{} not fulfil?
\inputexercise
{}
{
Show that in an
ordered field
the following properties hold.
\enumerationthree {We have
\mathrelationchain
{\relationchain
{a^2
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {If
\mathrelationchain
{\relationchain
{a
}
{ \geq }{b
}
{ \geq }{0
}
{ }{
}
{ }{
}
}
{}{}{}
holds, then also
\mathrelationchain
{\relationchain
{a^n
}
{ \geq }{b^n
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds for all
\mathrelationchain
{\relationchain
{n
}
{ \in }{ \N
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {From
\mathrelationchain
{\relationchain
{a
}
{ \geq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we get
\mathrelationchain
{\relationchain
{a^n
}
{ \geq }{a^m
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
for integer numbers
\mathrelationchain
{\relationchain
{n
}
{ \geq }{m
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
Let $K$ be an
ordered field
and
\mathrelationchain
{\relationchain
{ x
}
{ > }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Show that also the inverse element $x^{-1}$ is positive.
\inputexercise
{}
{
Let $K$ be an
ordered field
and
\mathrelationchain
{\relationchain
{ x
}
{ \geq }{ 1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Show that for the inverse element
\mathrelationchain
{\relationchain
{ x^{-1}
}
{ \leq }{ 1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
\inputexercise
{}
{
Let $K$ be an
ordered field
and
\mathrelationchain
{\relationchain
{ x
}
{ > }{ y
}
{ > }{ 0
}
{ }{
}
{ }{
}
}
{}{}{.}
Show that for the
inverse elements
\mathrelationchain
{\relationchain
{ x^{-1}
}
{ < }{ y^{-1}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds.
\inputexercise
{}
{
Let $K$ be an
ordered field
and let $x, y$ be positive elements. Show that
\mathrelationchain
{\relationchain
{x
}
{ \geq }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
is equivalent with
\mathrelationchain
{\relationchain
{ { \frac{ x }{ y } }
}
{ \geq }{1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
\inputexercise
{}
{
Let $K$ be an
ordered field
and
\mathcond {b \in K} {}
{b> 1} {}
{} {} {} {.}
Show that there exists elements
\mathrelationchain
{\relationchain
{c,d
}
{ > }{ 1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
such that
\mathrelationchain
{\relationchain
{b
}
{ = }{cd
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
\inputexercise
{}
{
Let $K$ denote an ordered field. We consider the mapping
$\Z \rightarrow K$
constructed in
exercise *****.
a) Show that this mapping is injective.
b) Show that this mapping can be extended to an injective mapping
$\Q \rightarrow K$
such that the addition and multiplication in $\Q$ and in $K$ coincide, and such that the ordering of $\Q$ coincides with the ordering of $K$.
\inputexercise
{}
{
Let $K$ denote an
ordered field.
Show that for
\mathrelationchain
{\relationchain
{x
}
{ \geq }{3
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
the relation
\mathrelationchaindisplay
{\relationchain
{ x^2 +(x+1)^2 }
{ \geq} { (x+2)^2
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{}
holds.
\inputexercise
{}
{
Let
\mathrelationchain
{\relationchain
{ x
}
{ < }{ y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be two real numbers. Show that for the
arithmetic mean
${ \frac{ x+y }{ 2 } }$ the inequalities
\mathrelationchaindisplay
{\relationchain
{x
}
{ <} { { \frac{ x+y }{ 2 } }
}
{ <} {y
}
{ } {}
{ } {}
}
{}{}{}
hold.
\inputexercise
{}
{
Write a computer-program
\extrabracket {pseudocode} {} {}
which computes the
arithmetic mean
of two given non negative rational numbers.
\auflistungfuenf {The computer has as many memory units as needed, which can contain natural numbers.
}{It can add the content of two memory units and write the result into another memory unit.
}{It can multiply the content of two memory units and write the result into another memory unit.
}{It can print contents of memory units and it can print given texts.
}{There is a stop command.
}
The initial configuration is
\mathdisp {(a,b,c,d,0,0,0, \ldots )} { }
with
\mathrelationchain
{\relationchain
{b,d
}
{ \neq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Here
\mathcor {} {a/b} {and} {c/d} {}
represent the rational numbers from which we want to compute the arithmetic mean. The result should be printed
\extrabracket {in the form numerator denominator} {} {}
and then the program shall stop.
\inputexercise
{}
{
Discuss the
operation
\mathdisp {\R_{\geq 0} \times \R_{\geq 0} \longrightarrow \R_{\geq 0}
, (x,y) \longmapsto \operatorname{max} \, (x,y)} { , }
looking at associative law, commutative law, existence of a neutral element and existence of inverse element.
\inputexercise
{}
{
Some bacterium wants to walk around the earth along the equator. It is quite small and during a day it makes exactly $2$ millimeter. How many days does it take for it to orbit the earth once?
\inputexercise
{}
{
How many trillionths does it take to reach one billionth?
\inputexercise
{}
{
In the forest, a giant is living, which height is $8$ meter and $37$ cm. There is also a colony of dwarfs, their height at the shoulder is $3$ cm and their height including the head is $4$. The neck and the head of the giant is $1,23$ meter high. On the shoulder of the giant there stands a dwarf. How many dwarfs have to stand above each other
\extrabracket {on their shoulders} {} {}
such that the dwarf on top is at least on the level of the dwarf on the giant?
\inputexercise
{}
{
Show that in $\R$ the following properties hold.
\enumerationtwo {For
\mathrelationchain
{\relationchain
{x
}
{ > }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists a natural number $n$ such that
\mathrelationchain
{\relationchain
{ { \frac{ 1 }{ n } }
}
{ < }{ x
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For two real numbers
\mathrelationchain
{\relationchain
{x
}
{ < }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
there exists a rational number \mathl{n/k}{} (with
\mathrelationchain
{\relationchain
{n
}
{ \in }{\Z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{,}
\mathrelationchain
{\relationchain
{k
}
{ \in }{\N_+
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}) such that
\mathrelationchaindisplay
{\relationchain
{x
}
{ <} { { \frac{ n }{ k } }
}
{ <} {y
}
{ } {
}
{ } {
}
}
{}{}{.}
}
\inputexercise
{}
{
Compute the
floor
\mathdisp {\left \lfloor { \frac{ 513 }{ 21 } } \right \rfloor} { . }
\inputexercise
{}
{
Prove the following properties for the
absolute value function
\mathdisp {\R \longrightarrow \R
, x \longmapsto \betrag { x }} { , }
(here let $x,y$ be arbitrary real numbers).
\enumerationeight {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ \geq }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{x
}
{ = }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { x }
}
{ = }{\betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{x
}
{ = }{y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
or
\mathrelationchain
{\relationchain
{x
}
{ = }{-y
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { y-x }
}
{ = }{ \betrag { x-y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \betrag { xy }
}
{ = }{ \betrag { x } \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{x
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \betrag { x^{-1} }
}
{ = }{ \betrag { x }^{-1}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {We have
\mathrelationchain
{\relationchain
{ \betrag { x+y }
}
{ \leq }{ \betrag { x } + \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
\extrabracket {triangle inequality for modulus} {} {.}
} {
\mathrelationchain
{\relationchain
{ \betrag { x+y }
}
{ \geq }{ \betrag { x } - \betrag { y }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
Let $x_1 , \ldots , x_n$ be real numbers. Show by
induction
the following inequality
\mathrelationchaindisplay
{\relationchain
{\betrag { \sum_{i = 1}^n x_i }
}
{ \leq} { \sum_{i = 1}^n \betrag { x_i }
}
{ } {}
{ } {}
{ } {}
}
{}{}{.}
The idea of the following exercises came from http://jwilson.coe.uga.edu/emt725/Challenge/Challenge.html, also have a look at http://www.vier-zahlen.bplaced.net/raetsel.php .
\inputexercise
{}
{
We consider the mapping
\mathdisp {\Psi \colon \N^4 \longrightarrow \N^4} { }
that assigns to a four tuple \mathl{(a,b,c,d)}{} the four-tuple
\mathdisp {( \betrag { b-a } , \betrag { c-b } , \betrag { d-c } , \betrag { a-d } )} { . }
We denote by \mathl{\Psi^n}{} the $n$-th fold
composition
of $\Psi$ with itself.
\enumerationthree {Compute
\mathdisp {\Psi (6,5,2,8), \, \Psi^2 (6,5,2,8), \, \Psi^3 (6,5,2,8), \, \Psi^4 (6,5,2,8)\, ...} { }
until the result is the zero-tuple \mathl{(0,0,0,0)}{.}
} {Compute
\mathdisp {\Psi (1,10,100,1000), \, \Psi^2 (1,10,100,1000), \, \Psi^3 (1,10,100,1000), \, \Psi^4 (1,10,100,1000) \, ...} { }
until the result is the zero-tuple \mathl{(0,0,0,0)}{.}
} {Show that
\mathrelationchain
{\relationchain
{ \Psi^4 (0,0,n,0)
}
{ = }{ (0,0,0,0)
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
for every
\mathrelationchain
{\relationchain
{ n
}
{ \in }{ \N
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
We consider the mapping
\mathdisp {\Psi \colon \N^4 \longrightarrow \N^4} { }
that assigns to a four-tuple \mathl{(a,b,c,d)}{} the four-tuple
\mathdisp {( \betrag { b-a } , \betrag { c-b } , \betrag { d-c } , \betrag { a-d } )} { . }
Determine whether $\Psi$ is
injective
and whether $\Psi$ is
surjective.
\inputexercise
{}
{
We consider the mapping
\mathdisp {\Psi \colon \N^4 \longrightarrow \N^4} { }
that assigns to a four-tuple \mathl{(a,b,c,d)}{} the four-tuple
\mathdisp {( \betrag { b-a } , \betrag { c-b } , \betrag { d-c } , \betrag { a-d } )} { . }
Show that for any initial value \mathl{(a,b,c,d)}{,} after finitely many iterations, this map reaches the zero-tuple.
\inputexercise
{}
{
We consider the mapping
\mathdisp {\Psi \colon \N^4 \longrightarrow \N^4} { }
that assigns to a four-tuple \mathl{(a,b,c,d)}{} the four-tuple
\mathdisp {( \betrag { b-a } , \betrag { c-b } , \betrag { d-c } , \betrag { a-d } )} { . }
Find an example of a four-tuple \mathl{(a,b,c,d)}{} with the property that all iterations \mathl{\Psi^n (a,b,c,d)}{} for
\mathrelationchain
{\relationchain
{ n
}
{ \leq }{ 25
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
do not yield the zero-tuple. Check your result on http://www.vier-zahlen.bplaced.net/raetsel.php .
We will later deal with the question on how it is with real four tuples, see in particular
Exercise 28.10
.
\inputexercise
{}
{
Let $K$ be an
ordered field
and
\mathrelationchain
{\relationchain
{n
}
{ \in }{ \N_+
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Show the following statements.
\enumerationthree {The mapping
\mathdisp {K_{\geq 0} \longrightarrow K
, x \longmapsto x^n} { , }
is
strictly increasing.
} {The mapping
\mathdisp {K_{\leq 0} \longrightarrow K
, x \longmapsto x^n} { , }
is for $n$ odd
strictly increasing.
} {The Mapping
\mathdisp {K_{\leq 0} \longrightarrow K
, x \longmapsto x^n} { , }
is for $n$ even
strictly decreasing.
}
\inputexercise
{}
{
Let
\mathdisp {f_1 , \ldots , f_n \colon \R \longrightarrow \R} { }
be functions, which are increasing or decreasing, and let
\mathrelationchain
{\relationchain
{ f
}
{ = }{ f_n \circ \cdots \circ f_1
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
be their
composition.
Let $k$ be the number of the decreasing functions among the $f_i$'s. Show that if $k$ is even, then $f$ is
increasing,
and if $k$ is odd, then $f$ is
decreasing.
The solution to the exercises of complex numbers always has to be written like $a+b { \mathrm i}$ with real numbers $a,b$ whereas those have to be as simple as possible.
\inputexercise
{}
{
Calculate the following expressions in the
complex numbers.
\enumerationsix {$(5+4 { \mathrm i} )(3-2 { \mathrm i})$.
} {$(2+3 { \mathrm i})(2-4 { \mathrm i}) +3(1-{ \mathrm i})$.
} {$(2{ \mathrm i}+3)^2$.
} {${ \mathrm i}^{1011}$.
} {$(-2+5{ \mathrm i})^{-1}$.
} {$\frac{4-3{ \mathrm i}}{2+{ \mathrm i}}$.
}
\inputexercise
{}
{
Show that the
complex numbers
constitute a
field.
\inputexercise
{}
{
Show that
\mathrelationchain
{\relationchain
{ P
}
{ = }{ \R^2
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
with componentwise addition and componentwise multiplication is not a
field.
\inputexercise
{}
{
Prove the following statements concerning the
real
and
imaginary
parts of a
complex number.
\enumerationfive {
\mathrelationchain
{\relationchain
{ z
}
{ = }{
\operatorname{Re} \, { \left( z \right) } +
\operatorname{Im} \, { \left( z \right) } { \mathrm i}
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Re} \, { \left( z+w \right) }
}
{ = }{
\operatorname{Re} \, { \left( z \right) } +
\operatorname{Re} \, { \left( w \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z+w \right) }
}
{ = }{
\operatorname{Im} \, { \left( z \right) } +
\operatorname{Im} \, { \left( w \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{r
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathdisp {\operatorname{Re} \, { \left( rz \right) } =r
\operatorname{Re} \, { \left( z \right) } \text{ und }
\operatorname{Im} \, { \left( rz \right) } =r
\operatorname{Im} \, { \left( z \right) }} { . }
} {The equation
\mathrelationchain
{\relationchain
{ z
}
{ = }{
\operatorname{Re} \, { \left( z \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
holds if and only if
\mathrelationchain
{\relationchain
{z
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
and this holds if and only if
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z \right) }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
Show that for a
complex number
$z$ the following relations hold.
\enumerationthree {
\mathrelationchain
{\relationchain
{ \overline{ z }
}
{ = }{
\operatorname{Re} \, { \left( z \right) } - { \mathrm i}
\operatorname{Im} \, { \left( z \right) }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Re} \, { \left( z \right) }
}
{ = }{ { \frac{ z+ \overline{ z } }{ 2 } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{
\operatorname{Im} \, { \left( z \right) }
}
{ = }{ { \frac{ z - \overline{ z } }{ 2 { \mathrm i} } }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{}
{
Prove the following properties of the
absolute value
of a
complex number.
\aufzaehlungsieben {
\mathrelationchaindisplay
{\relationchain
{ \betrag { z }
}
{ =} { \sqrt{ z \ \overline{ z } }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {For a real number $z$ its real absolute value and its complex absolute value coincide.
} {We have
\mathrelationchain
{\relationchain
{ \betrag { z }
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{ z
}
{ = }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchaindisplay
{\relationchain
{ \betrag { z }
}
{ =} { \betrag { \overline{ z } }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {
\mathrelationchaindisplay
{\relationchain
{ \betrag { zw }
}
{ =} { \betrag { z } \betrag { w }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{ z
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \betrag { 1/z }
}
{ = }{ 1/ \betrag { z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchaindisplay
{\relationchain
{ \betrag {
\operatorname{Re} \, { \left( z \right) } }, \betrag {
\operatorname{Im} \, { \left( z \right) } }
}
{ \leq} { \betrag { z }
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}
}
\subtitle {Hand-in-exercises}
\inputexercise
{m}
{
Let $K$ be an
ordered field
and
\mathrelationchain
{\relationchain
{ x
}
{ < }{ 0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
Show that also the inverse element $x^{-1}$ is negative.
\inputexercise
{m}
{
Prove that a strictly increasing function
\mathdisp {f \colon \R \longrightarrow \R} { }
is injective.
\inputexercise
{m}
{
We consider the mapping
\mathdisp {\Psi \colon \Q_{\geq 0}^4 \longrightarrow \Q_{\geq 0}^4} { }
that assigns to a four-tuple of nonnegative rational numbers \mathl{(a,b,c,d)}{} the four-tuple
\mathdisp {( \betrag { b-a } , \betrag { c-b } , \betrag { d-c } , \betrag { a-d } )} { }
Show that after finitely many iterations, this mapping yields the zero-tuple.
Hint: Use
Exercise 5.27
.
\inputexercise
{m}
{
Calculate the
complex numbers
\mathdisp {(1+ { \mathrm i} )^n} { }
for
\mathrelationchain
{\relationchain
{ n
}
{ = }{ 1,2,3,4,5
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
\inputexercise
{m}
{
Prove the following properties of the
complex conjugation.
\enumerationsix {
\mathrelationchain
{\relationchain
{ \overline{ z+w }
}
{ = }{ \overline{ z } + \overline{ w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ -z }
}
{ = }{ - \overline{ z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ z \cdot w }
}
{ = }{ \overline{ z } \cdot \overline{ w }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {For
\mathrelationchain
{\relationchain
{z
}
{ \neq }{0
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
we have
\mathrelationchain
{\relationchain
{ \overline{ 1/z }
}
{ = }{ 1/\overline{ z }
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ \overline{ z } }
}
{ = }{ z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
} {
\mathrelationchain
{\relationchain
{ \overline{ z }
}
{ = }{ z
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{}
if and only if
\mathrelationchain
{\relationchain
{z
}
{ \in }{\R
}
{ }{
}
{ }{
}
{ }{
}
}
{}{}{.}
}
\inputexercise
{m}
{
Calculate the square roots, the fourth roots and the eighth roots of ${ \mathrm i}$.
\inputexercise
{m}
{
Find the three complex numbers $z$ such that
\mathrelationchaindisplay
{\relationchain
{ z^3
}
{ =} { 1
}
{ } {
}
{ } {
}
{ } {
}
}
{}{}{.}