Maths Olympiad Prep

Library / /24 of 121

Geometry Difficulty 5.4 AIME, harder Prove it India

Problem:

For any natural number nn (n3n \geq 3), let f(n)f(n) denote the number of non-congruent integer-sided triangles with perimeter nn (e.g., f(3)=1f(3)=1, f(4)=0f(4)=0, f(7)=2f(7)=2). Show that

a. f(1999)>f(1996)f(1999) > f(1996)

b. f(2000)=f(1997)f(2000) = f(1997).

Solution

Solution:

a. Let a,b,ca, b, c be the sides of a triangle with a+b+c=1996a + b + c = 1996, and each being a positive integer. Then a+1,b+1,c+1a + 1, b + 1, c + 1 are also sides of a triangle with perimeter 19991999 because
a<b+ca+1<(b+1)+(c+1) a < b + c \quad \Longrightarrow \quad a + 1 < (b + 1) + (c + 1)
and so on. Moreover, (999,999,1)(999, 999, 1) form the sides of a triangle with perimeter 19991999, which is not obtainable in the form (a+1,b+1,c+1)(a + 1, b + 1, c + 1) where a,b,ca, b, c are the integers and the sides of a triangle with a+b+c=1996a + b + c = 1996. We conclude that f(1999)>f(1996)f(1999) > f(1996).

b. As in the case (a) we conclude that f(2000)f(1997)f(2000) \geq f(1997). On the other hand, if x,y,zx, y, z are the integer sides of a triangle with x+y+z=2000x + y + z = 2000, and say xyz1x \geq y \geq z \geq 1, then we cannot have z=1z = 1; for otherwise we would get x+y=1999x + y = 1999 forcing x,yx, y to have opposite parity so that xy1=zx - y \geq 1 = z violating triangle inequality for x,y,zx, y, z. Hence xyz>1x \geq y \geq z > 1. This implies that x1y1z1>0x - 1 \geq y - 1 \geq z - 1 > 0. We already have x<y+zx < y + z. If xy+z1x \geq y + z - 1, then we see that y+z1x<y+zy + z - 1 \leq x < y + z, showing that y+z1=xy + z - 1 = x. Hence we obtain 2000=x+y+z=2x+12000 = x + y + z = 2x + 1 which is impossible. We conclude that x<y+z1x < y + z - 1. This shows that x1<(y1)+(z1)x - 1 < (y - 1) + (z - 1) and hence x1,y1,z1x - 1, y - 1, z - 1 are the sides of a triangle with perimeter 19971997. This gives f(2000)f(1997)f(2000) \leq f(1997). Thus we obtain the desired result.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.