|
|
|
|
Due date if any
|
Fuchsia means graded homework.
|
|
|
|
|
A date not given
|
-
Section 4.5, page 321, problems 2, 4, 10, 14, 15a.
|
|
|
|
|
A date not given
|
-
Section 4.4, page 310, problems 2, 3a, 4a, (22, 23 (both a bit hard)).
|
|
|
|
|
A date not given
|
-
Section 4.3, page 298, problems 1ac, 2a, 3a, 10e, 16, 26 (a bit hard).
|
|
|
|
|
A date not given
|
-
Section 4.2, page 277, problems 1, 19, 29 (a bit hard).
|
|
|
|
|
A date not given
|
-
Section 4.1, page 264, problems 2, 17bc, 25bd.
|
|
|
|
|
A date not given
|
-
Section 3.4, page 227, problems 8.
|
|
|
|
|
A date not given
|
-
Section 3.3, page 219, problems 2a, 11a.
|
|
|
|
|
A date not given
|
-
Section 3.2, page 208, problems 1c, 17, 24 (a bit hard).
|
|
|
|
|
A date not given
|
-
Section 3.1, page 193, problems 1, 3ab, 4bc, 6, 18a, 32.
|
|
|
|
|
9 November 2018
|
-
Problems to be converted into correct logical terms at
181028_MATH2dddHW.pdf.
Remember, handwritten answers only.
|
|
|
|
|
A date not given
|
-
Section 2.6, page 164, problems 1b, 2b, 3b, 4b, 5b (is easy!), 8 (not easy),
17 (not easy, same method as for problem 8), 21.
|
|
|
|
|
A date not given
|
-
Section 2.5, page 146, problems 1, 2, 6, 12, 14c, 22, 39 (very hard, until you
see the easy proof).
|
|
|
|
|
A date not given
|
-
Section 2.4, page 130, problems 1bc, 8d, 15, 19b.
|
|
|
|
|
A date not given
|
-
Section 2.3, page 121, problems 1abd, 2, 3e, 4b, 13.
|
|
|
|
|
A date not given
|
-
Section 2.2, page 107, problems 1abcd, 2abcdf, 3fg, 6ab, 14a (a bit long), 23.
|
|
|
|
|
A date not given
|
-
Section 2.1, page 96, problems 1bcehi, 2acd (2g is true but not easy to prove),
4ad (4 is a proof writing exercise), 10bc (proof writing), 13c (ignore the
hint).
|
|
|
|
|
1 October 2018
|
-
Problems to be converted into correct logical terms at
180923_MATH2dddHW.pdf.
Remember, handwritten answers only.
|
|
|
|
|
A date not given
|
-
Section 1.5, page 65, problems 4, 13, 17, 22, 28, 30.
In some problems you have to pick your own good formal language,
|
|
|
|
|
A date not given
|
-
Section 1.4, page 51, problems 1, 2ab, 9a, 10ad, 11, 14, 15.
|
|
|
|
|
A date not given
|
-
Section 1.3, page 37, problems 1, 3, 5, 8, 9, 11abc, 21, 23ab (just simplify).
|
|
|
|
|
A date not given
|
-
Section 1.2, page 20, problems 2ad, 4c, 8c, 9b, 18, 24, 29ab.
|
|
|
|
|
A date not given
|
-
Players A and B play the following game.
There is this pile of 100 pennies.
Players A and B alternate taking 1 or 2 pennies from the pile, where A begins.
Winner is the one who takes the last penny or pennies.
Which of the players has a winning strategy, and why?
Give a simple description of this winning strategy.
-
Suppose we draw a connected graph on paper with at most 10 nodes (also
called vertices) and with lines (also called edges) between them. The edges are
not allowed to cross one another (also called a planar graph).
What you see are V nodes (V at most 10) and E lines.
These lines divide the plane into S surfaces.
For example, you may happen to draw a triangle.
We have V = 3 nodes, E = 3 lines, and S = 2 surfaces (the surface inside the
triangle and the surface outside the triangle).
It turns out that whatever such graph you draw with V at most 10, the
values of V, S, and E are always such that V + S = E + 2.
You may use this as a fact.
Quest. Show that if you draw any connected planar graph with V =
11 nodes, then we again have the formula V + S = E + 2.
|