AMS 301 - Homework 7 Solutions

7.1.12
Recall that this is very similar to the lines in the plane problem of example 3. If every circle intersects every other circle in exactly two (unique) places, then we note that each circle has exactly 2(n 1) crossing points on its circumference. Each crossing point is a sign that the circle has crossed into a new region, and therefore has split the old region into 2. Therefore, if we imagine the circles being added one at a time, the last circle splits 2(n 1) regions into 2, and causes an = an1 + 2(n 1) regions total. The initial condition for the circle problem is a0 = 1, the same as with the lines.

7.1.13
First place the k parallel lines. These lines split the plane into k + 1 pieces. This gives us our initial condition ak = k + 1. Now add the remaining intersecting lines and note the number of regions split by the last one. The last line intersects all n of the preceding lines, and so it has n 1 crossing points. n 1 crossing points cut a line into n pieces, and each piece cuts an old region into 2. Therefore, the recurrence relation is an = an1 + n, for ak = k + 1. To nd the number of regions for n = 9 and k = 3, we solve the recursion, to get an,k = n(n+1) k+1) 1(4) (k2)( . That means that a9,3 = 9(10) 2 2 2 2 = 45 2 = 43. Equivalently, a9,3 = 9 + 8 + 7 + 6 + 5 + 4 + 4 = 43.

7.1.47
The key observation for this problem is the triangle inequality. That is if a + b + c = n with a b c, then (a, b, c) species a realizable integral-sided triangle whose perimeter is n if and only if a + b > c. We can note the rst few small examples. Since 3 is the smallest possible perimeter, an = 0 for n < 3. We see that (1, 1, 1) implies that a3 = 1. a4 = 0, as a triangle with perimeter 4 can have at most one side of length 2 and 1 + 1 > 2. a5 = 1, with (1, 2, 2), a6 = 1 with (2, 2, 2), a7 = 2 with (1, 3, 3) and (2, 2, 3), and a8 = 1 with (2, 3, 3). Observe that the triangle with perimeter 3, (1, 1, 1), is related to the triangle with perimeter 6, (2, 2, 2), and the triangle with perimeter 5, (1, 2, 2) is related to the triangle with perimeter 8, (2, 3, 3). This observation allows us to note that if a, b, c is a realizable triangle with perimeter n, then (a + 1, b + 1, c + 1) is a realizable triangle with perimeter n + 3. This is because we have (a + 1) + (b + 1) + (c + 1) = n + 3 and (a + 1) + (b + 1) = a + b + 2 > c + 1, which follows from a + b > c. This divides the triangles into 2 groups, those that can be realized in that way, with (a 1) + (b 1) > (c 1), and those that cannot, with (a 1) + (b 1) = (c 1). That means that an an3 and the dierence between the two is exactly the number of triangles that cannot be realized as smaller triangles with extended edges, that is the (a, b, c) with a + b = c + 1. Now we use the hint and split into even and odd cases to look for the triangles (a, b, c) with a + b = c + 1. If n is even, then we have that a + b + c = n is even. If we look at it as (a + b) + c = n, we see that (a + b) and c must sum to an even number. That means both must be even, or both must be odd. But we have that (a + b) = c + 1, meaning (a + b) and c cannot have the same parity. This contradiction implies that there are no triangles of the second type if n is even, so an = an3 for even n. 1

If n is odd, then we have that a + b + c = n is an odd number, and one of (a + b) and c must be even and the other odd. Since we know that for the second type of triangle, a + b = c + 1, that means there are triangles of the second type if n is odd and an > an3 for odd n 3. Now look at the two equations. a + b + c = n and a + b = c + 1, solving the second for c and plugging into the rst, we get a + b + (a + b 1) = n implying that a + b = n+1 2 . Since a b, we have that n+1 n+1 2a a + b = 2 and so a 4 . That is, the smallest side in a triangle of the second type is n+1 at most n+1 4 . Since a must be an integer, we round 4 down, using the greatest integer function n+1 x. That is 1 a 4 . Note that once a is xed, there is exactly one solution for b and c to make a + b + c = n and a + b = c + 1. That means there are exactly n+1 4 triangles of the second type if n is odd and greater or equal to 3. Putting it all together, we have that an = an3 if n is even and an = an3 + n+1 4 if n is odd. n2 If youre interested, this recursion solves exactly to 48 rounded to the nearest integer if n is even and
(n+3)2 48

rounded to the nearest integer if n is odd.

7.2.1
a. an = 2an/2 + 5 solves to An 5. b. an = 2an/4 + n solves to A n + 2n. c. an = an/2 + 2n 1 solves to A + 4n log2 n. d. an = 3an/3 + 4 solves to An 2. e. an = 16an/2 + 5n solves to An4
5n 7 .

f. an = 4an/2 + 3n solves to An2 3n.

7.2.3
Note that the organization of this problem gives a 10-ary tree. For simplicity we can assume n is a power of 10. (Remember n is the number of leaves, not the number of vertices. This implies that the number of people working at the company is a number of the form 111 . . . 111, known as a repunit.) a. We see that if we remove the top level (the root of the tree) of the managerial tree with height n h, the tree breaks into 10 subtrees, each with height h 1 and 10 leaves. That means the recurrence for the number of managerial levels is an = an/10 +1. This solves to an = log10 n, which is exactly the formula we noted for complete m-ary trees in Chapter 3. b. Using the same divide-and-conquer approach from part (a), we remove the root and note 10 identical subtrees one-tenth of the size of the original. That means that the recurrence for the number of managers (not counting salespeople) is an = 10an/10 + 1 with a10 = 1. This 1 k solves to an = n 9 , which is a repunit when n = 10 .