- Warm-up-exercises
Let and denote sets. Prove the following identities.
-
-
-
-
-
-
-
-
-
Prove the following
(set-theoretical versions of)
syllogisms of Aristotle. Let denote sets.
- Modus Barbara:
and
imply
.
- Modus Celarent:
and
imply
.
- Modus Darii:
and
imply
.
- Modus Ferio:
and
imply
.
- Modus Baroco:
and
imply
.
Prove the following formulas by induction.
-
-
-
Show that (with
being the only exception) the relation
-
holds.
Show, by induction, that for every
,
the number
-
is a multiple of .
Prove, by induction, that the following inequality holds
-
Prove, by induction, that the formula
-
holds for all
.
The cities 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.
- Hand-in-exercises
Let
and
be sets. Show that the following facts are equivalent.
- ,
-
- ,
- ,
- There exists a set such that
,
- There exists a set such that
.
Prove, by induction, that the sum of consecutive odd numbers
(starting from )
is always a square number.
Fix
.
Show, by induction, that the following identity holds.
-
An -chocolate is a rectangular grid, which is divided by longitudinal grooves and by transverse grooves into
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
(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 -chocolate consists of exactly division steps.