The three sides of a triangle are of lengths m, n, and p. These are positive integers satisfying m n p.

p. (a) Take p=9 and find the number of triangles of the kind described. (b) Take other values of p and find a general law. I began with two small numbers, as those would be the easiest to do via brute force. For p=5 Count 1 2 3 4 5 6 7 8 9 For p=6 Count 1 2 3 4 5 6 7 8 9 10 11 12 n 6 6 6 6 6 6 5 5 5 5 4 4 m 6 5 4 3 2 1 5 4 3 2 4 3 n 5 5 5 5 5 4 4 4 3 m 5 4 3 2 1 4 3 2 3

Using the tables above, for a given value of p, I was able to see that nmin=p/2+1. nmax=p, as given by the problem. So, p-(p/2+1)+1= p/2 values exist for n. Every time time n decreased, the amount of creatable triangles decreased by 2. And for the initial n, where n=p, p amount of triangles can be made. This allowed for

Using properties of summation, I was able to set this equal to

) ( )

)(

For when p is odd: An odd number squared divided by 4 will always have remainder .25, and any odd number divided by 2 will always have a remainder of .5. As such, rounding for odd numbers will always work because the number will round up. Using the number 5, 5^2/4+5/2=8.75, which rounds to 9. This matches what I found with the table. For when p is even: No rounding is necessary, as any even number squared is evenly divisible by 4 and an even number, by definition, is evenly divisible by 2. Using the number 6, 6^2/4+6/2=36/4+6/2=9+3=12. This matches what I found with the table. Using this formula for 9 yields 25, which answers part (a) of the problem.