# Kurs:Mathematik für Anwender (Osnabrück 2011-2012)/Teil I/Arbeitsblatt 1/en/latex

Zur Navigation springen Zur Suche springen

\setcounter{section}{1}

\zwischenueberschrift{Warm-up-exercises}

\inputexercise
{}
{

Let $A,\, B$ and $C$ denote three sets. Prove the following identities. \aufzaehlungneun{ $A \cap \emptyset = \emptyset$, }{ $A \cup \emptyset = A$, }{ $A \cap B= B \cap A$, }{ $A \cup B= B \cup A$, }{ $A \cap (B \cap C) = (A \cap B) \cap C$, }{ $A \cup (B \cup C) = (A \cup B) \cup C$, }{ $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$, }{ $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$, }{ $A \setminus (B \cup C) = (A \setminus B) \cap (A \setminus C)$. }

}
{} {}

\inputexercise
{}
{

Prove the following \zusatzklammer {settheoretical versions of} {} {} syllogisms of Aristotle. Let $A,B,C$ denote sets. \aufzaehlungfuenf{Modus Barbara: $B \subseteq A$ and $C \subseteq B$ imply $C \subseteq A$. }{Modus Celarent: $B \cap A = \emptyset$ and $C \subseteq B$ imply $C \cap A = \emptyset$. }{Modus Darii: $B \subseteq A$ and $C \cap B \neq \emptyset$ imply $C \cap A \neq \emptyset$. }{Modus Ferio: $B \cap A = \emptyset$ and $C \cap B \neq \emptyset$ imply $C \not \subseteq A$. }{Modus Baroco: $B \subseteq A$ and $B \not \subseteq C$ imply $A \not \subseteq C$. }

}
{} {}

\inputexercise
{}
{

Prove the following formulas by induction. \aufzaehlungdrei{
\mathdisp {\sum_{i=1}^n i = \frac{n(n+1)}{2}} { , }
}{
\mathdisp {\sum_{i=1}^n i^2 = \frac{n(n+1)(2n+1)}{6}} { , }
}{
\mathdisp {\sum_{i=1}^n i^3 = \left(\frac{n(n+1)}{2} \right)^2} { . }
}

}
{} {}

\inputexercise
{}
{

Show that (with $n =3$ being the only exception) the relation
\mathdisp {2^n \geq n^2} { }
holds.

}
{} {}

\inputexercise
{}
{

Show by induction that for every $n \in \N$ the number
\mathdisp {6^{n+2} + 7^{2n+1}} { }
is a multiple of $43$.

}
{} {}

\inputexercise
{}
{

Prove by induction that the following inequality holds
\mathdisp {1 \cdot 2^2 \cdot 3^3 \cdots n^n \leq n^\frac{n(n+1)}{2}} { . }

}
{} {}

\inputexercise
{}
{

Prove by induction that the following formula holds for all
\mathl{n \in \N_+}{}
\mathdisp {\sum_{k=1}^n (-1)^{k-1} k^2 = (-1)^{n+1} { \frac{ n(n+1) }{ 2 } }} { . }

}
{} {}

\inputexercise
{}
{

The cities
\mathl{S_1, \ldots, S_n}{} are connected by roads and there is exactly one road between each couple of cities. Due to construction works at the moment all roads are drivable only in one direction. Show that nevertheless there exists one city from which you can reach all the others.

}
{} {}

\zwischenueberschrift{Hand-in-exercises}

\inputexercise
{4}
{

Let \mathkor {} {A} {and} {B} {} be two sets. Show that the following facts are equivalent. \aufzaehlungsechs{ $A \subseteq B$, }{ $A \cap B = A$, }{ $A \cup B = B$, }{ $A \setminus B = \emptyset$, }{There exist a set $C$ such that $B=A \cup C$, }{There exist a set $D$ such that $A=B \cap D$. }

}
{} {}

\inputexercise
{3}
{

Prove by induction that the sum of consecutive odd numbers \zusatzklammer {starting from $1$} {} {} is always a square number.

}
{} {}

\inputexercise
{3}
{

Fix
\mathl{m \in \N}{.} Show by induction that the following identity holds.
\mathdisp {(2m+1) \prod_{i=1}^m (2i-1)^2 = \prod_{k=1}^m (4k^2-1)} { . }

}
{} {}

\inputexercise
{4}
{

An $n$-chocolate is a rectangular grid, which is divided by
\mathl{a -1}{} longitudinal grooves and by
\mathl{b-1}{} transverse grooves into
\mathl{n= a \cdot b}{} \zusatzklammer {\mathlk{a,b \in \N_+}{}} {} {} smaller bite-sized rectangles. A dividing step of a chocolate is the complete severing of a chocolate along a longitudinal or a transverse groove. A complete breakdown of a chocolate is a consequence of division steps \zusatzklammer {each one applied to a previously obtained intermediate chocolate} {} {,} whose final product consists of all the small bite-sized pieces, more handy to be eaten. Show by induction that each breakdown of an $n$-chocolate consists of exactly
\mathl{n-1}{} division steps.

}
{} {}