Q2     Since the technique is simple induction, your technique should
       connect a valid schedule for n meals to a schedule for n+1 meals.
       You might write your technique as a recursive program (or definition)
       that starts from scheduling some (small) base number of meals, and then
       shows how to schedule n+1 meals, based on the schedule for n
       meals.

Q3     You could use some notation and denote the second denominator,
       n1-n2, as n3.  Can you say anything about the magnitude of n1, n2,
       n3? If so, repeat this process, and what can you say about n4?
       Does the assumption allow you to continue repeating this process?

       Notice that we're quite strict when we say "Use the previous
       part to prove that root 5 is irrational."  We know you can look up
       proofs of root 5's irrationality, based on removing common factors.
       This argument is different.

Q4     The deadline for submitting a solution to Q4 is now the same
       as assignment 2 --- October 27.