Assignment 1

The assignment 1 sample solution is posted yesterday. I read through this solution today, and the question 1 is almost the same as my solution. It could solved by adding one extra triangle.

The question 2 is slight different from my work, despite, we all divide the n+1_meal menus to the one include n+1_meal(s1) and the one not include n+1_meal.(s2) We know that the n+1_meal that not include the newly n+1_meal partition is identically the same as n_meal. My way does not inverse the s2 menu, instead I just jump back and forth from s1 to s2, which draw in graph is like a 0-1 voltage diagram. Which we has s1[0] to s2[0] to s2[1] to s1[1] to s1[2] to s2[2] to... and so on. I found my work is working but kinda not concise as the solution which is simple inverse the s2 and rest of work is just concatenate the head and tail. I will see whether my work will get full mark or not when the marked paper handed back.

The question 3 is interesting. Actually I have no idea about this question at all when I first read it. The I read some info. like wiki and other websites that have explanation of this kind question. After I grab all the key concept, I write my own work on this question, but it turns out, it is similarly to the one posted as solution. Maybe this is the standard solution or way to solve this kinda question? For the square root of 5 part, I use the same patten as the question to prove square root of 2 is irrational, simply because I can handle that proof well. So I just slight change and parameters, and leave the rest of answer as similar as proving square root of 2 question.