1.3.

4 In the xy-plane, what is the length of the shortest path from (0,0) to (12,16) that does not go inside the circle
(x 6)2 + (y 8)2 = 25

1.3.6 We know the minimum value that n can take is 333. Consider n = 333, the odds of rolling into a sum of 1994 is k.
We wish to find another value S that has chance k. To roll a sum of 1994 one needs to roll 332 6s and 1 2. The odds of
this are

2.2.9 Define f(x) = 1/1-x and denote r iterations of the function f by f r . Compute f 1999 (2000)

We first look at the first few iterations of the function on an arbitrary x.

f1 = 1/1-x
f2 = 1/1-(x-1)/x
f3 = 1/

We can see that after 3 iterations of the function on any arbitrary x, it results in x. Or rather after 3 iterations the
function repeats.
From this we can deduce that for a given function f r , if r is congruent to 0 mod 3, we end up with f 3 = x
2.2.15 For each integer n 1, find distinct positive integers x and y such that 1/x + 1/y = 1/n
420
4

1 1 1
2.2.23 Find infintely many postive Integer solutions for the equation x + y = n

We know that there exist infinitely many Pythagorean triples of the form a2 + b2 = c2 , because of this if we can show
that there exist a number of the form.
We use the Corollary that there exists infinitely many unique Pythagorean triples.

2.2.24

Observe that the difference between any two consecutive squares is an odd number of the form 2n+1. To create any
arbitrary number n, we compose it out of a series of operations.