Advanced Discrete Homework

Calkin, N. and Wilf, H. Recounting the Rationals.

1. The three arguments under the Tree of Fractions (p.2-3) have very similar logical
structures. For each one, create a logical “skeleton”, i.e., distill the structure of
the argument from the content.
2. Using the proof of “Every reduced rational number occurs at some vertex,”
(bottom of p. 2), come up with an algorithm, which, given any reduced fraction
r , finds where in the tree that fraction occurs.
s
3. In the second un-numbered paragraph on page three, they justify a claim rather
quickly, saying “the result follows by downward induction on the levels of the
tree.” Write this inductive proof.
4. Elaborate the extremely loaded final sentence on page three: “These maps are
reversible, proving the claim.”

Advanced Discrete Homework

Calkin, N. and Wilf, H. Recounting the Rationals.

5. The three arguments under the Tree of Fractions (p.2-3) have very similar logical
structures. For each one, create a logical “skeleton”, i.e., distill the structure of
the argument from the content.
6. Using the proof of “Every reduced rational number occurs at some vertex,”
(bottom of p. 2), come up with an algorithm, which, given any reduced fraction
r , finds where in the tree that fraction occurs.
s
7. In the second un-numbered paragraph on page three, they justify a claim rather
quickly, saying “the result follows by downward induction on the levels of the
tree.” Write this inductive proof.
8. Elaborate the extremely loaded final sentence on page three: “These maps are
reversible, proving the claim.”