As of March 2018, I’m taking a Mook course regaring discrete mathematics from Coursera. Unfortunately, the video lecture coverage is too narrow to understand the subject and to confidently solve assignments and quiz, which is why many students complain about the course. However, as beauty is in the eye of the beholder, I decided to see the bright side and to take this opportunity to study the given textbook thoroughly.

Despite I will probably drop the course, I hope I won’t give up the textbook and make this solution page to keep growing.

Section 1.2

Question 1a

If is odd, let where .

Although we found the solution, let’s do the similar math for even where .

Consequently, .

Question 1b

Let’s consider three cases of (n,k) is (even,even), (even,odd), or (odd,odd).

When (even,even), let , where .

When (even,odd), let ,

When (odd,odd), let ,

Consequently, .

Question 1c

Let , where m , p ,

Question 1d

Let , , where m, n and p, q ,

Question 2 ☆

Let ,

Question 3a

Question 3b

Question 3c

5 ways:

Question 3d ☆☆

Question 4

Question 5

does not imply .

Question 6

Question 7

Represent each number as , where . Since can attain at most 500 distinct values from , the considered set contains two numbers of form and TBD..