Solutions and Comments

Let ABC be a triangle with sides a, b, c, inradius r and circumradius R (using the conventional notation). Prove that

r 2R abc 2( a2 + b2 )( b2 + c2 )( c2 + a2 ) .

When does equality hold?

a2 -( b2 + c2 )(1-cosA)= b2 + c2 -2bccosA-( b2 + c2 )+( b2 + c2 )cosA (b-c)2 cosA0

a2 ( b2 + c2 )(1-cosA)=2( b2 + c2 )sin2 (A/2).

With similar inequalities for b and c, we find that

a2 b2 c2 8( a2 + b2 )( b2 + c2 )( c2 + a2 )sin2 (A/2)sin2 (B/2)sin2 (C/2).

Since r=4Rsin(A/2)sin(B/2)sin(C/2), the desired result follows. Equality holds if and only if the triangle is equilateral.
Comment. The identity in the solution can be obtained as follows. Let 2s=a+b+c. Then

r s-a =tan A 2 = sin A 2 cos A 2


a=2RsinA=4Rsin A 2 cos A 2 .


ar s-a =4Rsin2 A 2 .

Using similar identities for the other sides, we find that

abcr3 (s-a)(s-b)(s-c) =64 R3 sin2 A 2 sin2 B 2 sin2 C 2 .             (*)

Note that the area Δ of the triangle is given by

Δ=rs= abc 4R =s(s-a)(s-b)(s-c),

so that the left side of (*) becomes 4RΔ r2 (rs) Δ-2 =4 Rr2 . Substituting this in, dividing by 4R and taking the square root yields

r=4Rsin A 2 sin B 2 sin C 2 .

Let us say that a set S of nonnegative real numbers if hunky-dory if and only if, for all x and y in S, either x+y or x-y is in S. For instance, if r is positive and n is a natural number, then S(n,r)={0,r,2r,,nr} is hunky-dory. Show that every hunky-dory set is {0}, is of the form S(n,r) or has exactly four elements.
Solution 1. {0} and sets of the form {0,r} are clearly hunky-dory. Let S be a nontrivial hunky-dory set with largest postive element z. Then 2z\notS, so 0=z-zS. Thus, every hunky-dory set contains 0. Suppose that S has at least three elements, with least positive element a.
Suppose, if possible, that S contains an element that is not a positive integer multiple of a. Let b be the least nonmultiple of a. Then 0<b-a<b. Since b-a cannot be a multiple of a (why?), we must have b-a\notS and b+aS. Since z is the largest element of S, z-a and z-b belong to S. However, (z-a)-(z-b)=b-a does not belong to S, so 2z-(a+b)=(z-a)+(z-b)S. Therefore, 2z-(a+b)z, whence za+b, so that z=a+b. Thus, S contains {0,a,b,a+b}, with a+b the largest element. This subset is already hunky-dory. But suppose, if possible, S contains more elements. Let c be the smallest such element. Then 0<(a+b)-cSa(a+b)-cc<bc=ma for some positive integer m2. Since b+ma>b+a, b-ma must belong to S, and so be a multiple of a. This yields a contradiction. Hence, S must be equal to {0,a,b,a+b}.
The only remaining case is that S consists solely of nonnegative multiples of some element a. Let na be the largest such multiple. If n=2, then S=S(2,a). Suppose that n>2. Then (n-1)aS, so S contains {0,a,(n-1)a,na}, which is hunky-dory.
Suppose S contains a further multiple ma with 2mn-2. Since aS and na+a>na, (n-1)aS, so that n-(m+1)a=(n-1)a-maS(m+1)a=n-[n-(m+1)a]S. By induction, it can be shown that kaS for mkn. In particular, (n-2)aS so that 2a=na-(n-2)aS. But then 3a,4a,,na are in S and so S=S(n,a). The desired result follows,
Solution 2. [S. Niu] Let S={ a0 , a1 ,, an }, with a0 < a1 << an . The elements an - an , an - an-1 , , an - a0 are n+1 distinct elements of S listed in increasing order, and so a0 =0, and for each i with 0in, we must have that an - ai = an-i . Let i n 2 . Then in-i and so ai an-i ; thus, ai ( an )/2 an-i . Thus, if j>kn/2, aj - ak S.
Since 0< an-1 - an-2 < an - an-2 = a2 , it follows that an-1 - an-2 = a1 . Also, 0< an-1 - an-2 = a1 < an-1 - an-3 < an - an-3 = a3 , so that an-1 - an-3 = a2 . Continuing on in this way, we find that, for in/2,

0< an-1 - an-2 < an-1 - an-3 << an-1 - an-i < an - an-i = ai ,

whence an-1 - an-j = aj-1 for 1j(n/2).
Now 0< an-2 - an-3 < an-1 - an-3 = a2 so an-2 - an-3 = a1 . We can proceed in this fashion to obtain that, for jn/2, aj+1 - aj = a1 . Hence, for i(n/2)-1, ai+1 - ai =( an - an-i-1 )-( an - an-i )= an-i - an-i-1 = a1 .
Let n=2m. Then ai = ia1 and an-i = an - ia1 for 1im, so that am = ma1 and an = am + ma1 = na1 . It follows that ak = ka1 for 1kn and S=S(n, a1 ).
Let n=2m+1. If m=0, then S={0, a1 }=S(1, a1 ). If m=1, then S={0, a1 , a3 - a1 , a3 }={0, a1 , a2 , a1 + a2 } is a 4-element hunky-dory set. Let m2. Then, for 1im, ai = ia1 and an-i = an - iai . Now am+1 = an - am > an-1 - am > am+2 - am > am+1 - am a1 . Since { an - am = am+(m+1) - am , an-1 - am ,, am+2 - am , am+1 - am } contains m+1 elements, we must have am+j - am = aj for 1jn-m=m+1. Therefore, ai = iai for 1in. (Why does this last statement fail to follow when m=1?)

(a) ABCDEF is a convex hexagon, each of whose diagonals AD, BE and CF pass through a common point. Must each of these diagonals bisect the area?
(b) ABCDEF is a convex hexagon, each of whose diagonals AD, BE and CF bisects the area (so that half the area of the hexagon lies on either side of the diagonal). Must the three diagonals pass through a common point?
Solution 1. (a) No, they need not bisect the area. Let the vertices of the hexagon have coordinates (-1,0), (-1,-1), (1,-1), (1,0), (-t,t), (t,-t) with t>0 but t1. The diagonals with equations y=0, y=x and y=-x intersect in the origin but do not bisect the area of the hexagon.
(b) Let the hexagon be ABCDEF and suppose that the intersection of the diagonals AD and BE is on the same side of CF as the side AB. Thus, AB, CD and EF border on triangles whose third vertices form a triangle at the centre of the hexagon (we will show this triangle to be degenerate). Let a, b, c, d, e, f be the lengths of the rays from the respective vertices A, B, C, D, E, F to the vertices of the central triangle, whose sides are x, y, z so that the lengths of AD, BE and CF are respectively a+x+d, b+y+e, c+z+f. All lower-case variables represent nonnegative real numbers.
Let the areas of the bordering on FA, AB, BC, CD, DE, EF be respectively α, β, γ, δ, ε, φ, and let the area of the central triangle be λ. Then, since each diagonal bisects the area of the hexagon, we have that




>From the first two equations, we find that δ=α+λ. Similarly, φ=γ+λ and β=ε+λ.
Using the fact that the area of a trangle is half the product of adjacent sides and the sine of the angle between them, and the equality of opposite angles, we find that

1= α+λ δ = (a+x)(f+z) cd

1= γ+λ φ = (b+y)(c+z) ef

1= ε+λ β = (d+x)(e+y) ab .

Multiplying these three equations together yields that


whence x=y=z=0. Thus, the central triangle degenerates and the three diagonals intersect in a common point.
Solution 2. (a) No. Let ABCDEF be a regular hexagon. The diagonals AD, BE, CF intersect and each diagonal does bisect the area. Let X be any point other than F on the diagonal CF for which ABCDEX is still a convex hexagon. The diagonals of this hexagon are the same as those of the regular hexagon, and so have a common point of intersection. However, the diagonals AD and BE no longer intersect the area of the hexagon.
(b) [X. Li] Let ABCDEF be a given convex hexagon, each of whose diagonals bisect its area. Suppose that the diagonals AD and CF intersect at G. As in Solution 1, we can determine that the areas of triangles AGF and DGC are equal, whence AG·GF=CG·GD, or AG/GD=CG/GF. Therefore, ΔAGC~ΔDGF (SAS). It follows that AC/DF=AG/GD=CG/GF, CAG=FDG, and so ACDF. In a similar way, we find that BFCE and AEBD, so that ΔACE~ΔDFB and AC/DF=CE/FB=EA/BD.
Suppose diagonals AD and BE intersect at H. Then, as above, we find that AG/GD=AC/DF=EA/BD=EH/HB=AH/HD, so that H=G. Hence, the three diagonals have the point G in common.

Determine all solutions in integer pairs (x,y) to the diophantine equation x2 =1+4 y3 (y+2).
Solution 1. Clearly, (x,y)=(±1,0),(±1,-2) are solutions. When y=-1, the right side is negative and there is no solution. Suppose that y1; then

(2 y2 +2y)2 =4 y4 +8 y3 +4 y2 >4 y4 +8 y3 +1


(2 y2 +2y-1)2 =4 y4 +8 y3 -4y+1<4 y4 +8 y3 +1

so that the right side is between two consecutive squares, and hence itself cannot be square.
Suppose that y-3. We first observe that for a given product p of two positive integers, the sum of these positive integers has a minium value of 2p (why?) and a maximum value of 1+p. This follows from the fact that, for integers u with 1up


We have that

[(2 y2 +2y-1)+x] [(2 y2 +2y-1)-x]=(2 y2 +2y-1)2 - x2 =(4 y4 +8 y3 -4y+1)-(4 y4 +8 y3 +1) =-4y.

Since 2 y2 +2y-1= y2 +(y+1)2 -2 is positive, at least one of the factors on the left is positive. Since the product is positive, both factors are positive. By our observation on the sum of the factors, we find that

4 y2 +4y-21-4y,

which is equivalent to

4(y-1)2 7.

However, this does not hold when y-3. Therefore, the only solutions are the four that we identified at the outset.
Solution 2. Since x must be odd, we can let x=2z+1 for some integer z, so that the equation becomes z(z+1)= y4 +2 y3 . We can deal with the cases that y=0,-1,-2 directly to obtain the solutions (x,y,z)=(1,0,0),(-1,0,-1),(1,-2,0),(-1,-2,-1). Henceforth, suppose that y1 or y-3, so that y4 +2 y3 is positive. Let φ(t)=t(t+1). Then φ(t) is increasing for t0 and φ(-t)=φ(t-1) for every integer t; thus, we need check only that y4 +2 y3 does not coincide with a value taken by φ(t) for nonnegative values of t.

φ( y2 +y)= y4 +2 y3 +2 y2 +y> y4 +2 y3 ;

φ( y2 +y-1)= y4 +2 y3 -y y4 +2 y3 ;

φ( y2 +y-2) = y4 +2 y3 -2 y2 -3y+2 = y4 +2 y3 -(2y+1)(y+1)+3< y4 +2 y3 .

It follows that φ(t) can never assume the value y4 +2 y3 for any positive t, and hence for any t. Thus, the solutions already listed comprise the complete solution set.

Determine the least positive number p for which there exists a positive number q such that

1+x+1-x2- xp q

for 0x1. For this least value of p, what is the smallest value of q for which the inequality is satisfied for 0x1?
Comments. Recall the binomial expansion

(1+x)n =1+nx+ n(n-1) 2! x2 + n(n-1)(n-2) 3! x3 ++ n(n-1)(n-r+1) r! xr +.

When n is not a nonnegative integer, this is an infinite series that converges when 0x<1 to (1+x)n . The partial sums constitute a close approximation. When n= 1 2 , we have that

(1±x) 1 2 =1± 1 2 x- 1 8 x2 ± 1 16 x3 - 5 128 x4 ±

so that

(1+x) 1 2 +(1-x) 1 2 ~2- x2 4 - x4 8 2- x4 4 .

This suggests that we are looking for (p,q)=(2,4). However, the approximation approach is not sufficiently rigorous, and we need to find an argument in finite terms that will work.
Solution 1. Observe that, for 0x1,

1±x1± 1 2 x- 1 8 x2 ± 1 16 x3

&lrArr;1±x1±x+ 5 64 x4 1 64 x5 + 1 256 x6

&lrArr;05x+4 x2 .

The last inequality clearly holds, so the first must as well. Hence

1+x+1-x2(1- 1 8 x2 )=2- 1 4 x2

so the pair (p,q)=(2,4) works for all x[0,1].
Suppose, for some constants p and c with 0<p<2 and c>0,

1+x+1-x2-2 cxp

for 0x1. For this range of x, this is equivalent to

2+21- x2 4-8 cxp +4 c2 x2p

&lrArr;1- x2 1-4 cxp +2 c2 x2p

&lrArr;1- x2 1-8 cxp +20 c2 x2p -16 c3 x3p +4 c4 x4p

8c x2-p +4 c2 xp (5-4 cx2p + c3 x3p ).

However, for x sufficiently small, the right side can be made less than 8c, yielding a contradiction. Hence, when 0<p<2, there is no value that yields the desired inequality.
Now we look at the situation when p=2 and q>0. For 0x1,

1+x+1-x2- x2 q

&lrArr;2(1+1- x2 )4- 4 x2 q + x4 q2

&lrArr;1- x2 1- 2 x2 q + x4 2 q2

&lrArr;1- x2 1- 4 x2 q + 5 x4 q2 - 2 x6 q3 + x8 4 q4

&lrArr;0 x2 [ (1- 4 q )+ x2 q2 (5- 2 x2 q + x4 4 q2 ) ].

If q<4, then the quantity in square brackets is negative for small values of x. Hence, for the inequality to hold for all x in the interval [0,1], we must have q4. Hence, p must be at least 2, and for p=2, q must be at least 4.
Solution 2. [R. Furmaniak] The given inequality is equivalent to

q xp 2-1+x-1-x = xp (2+1+x+1-x) 4-(2+21- x2 ) = xp (2+1+x+1-x) 2(1-1- x2 ) = xp (2+1+x+1-x)(1+1- x2 ) 2 x2 .

If p<2, then the right side becomes arbitrarily large as x gets close to zero, so the inequality becomes unsustainable for any real q. Hence, for the inequality to be viable, we require p2. When p=2, we can cancel x2 and see by taking x=0 that q4. It remains to verify the inequality when (p,q)=(2,4). We have the following chain of logically equivalent statements, where y=1- x2 (note that 0x1):

1+x+1-x2- x2 4

&lrArr;2+21- x2 4- x2 + x4 16

&lrArr;321- x2 x4 -16 x2 +32

&lrArr;32y1-2 y2 + y4 -16+16 y2 +32


0 y4 +14 y2 -32y+17=(y-1)2 ( y2 +2y+17)=(y-1)2 [(y+1)2 +16].

Since the last inequality is clearly true, the first holds and the result follows.

G is a connected graph; that is, it consists of a number of vertices, some pairs of which are joined by edges, and, for any two vertices, one can travel from one to another along a chain of edges. We call two vertices adjacent if and only if they are endpoints of the same edge. Suppose there is associated with each vertex v a nonnegative integer f(v) such that all of the following hold:
(1) If v and w are adjacent, then f(v)-f(w)1.
(2) If f(v)>0, then v is adjacent to at least one vertex w such that f(w)<f(v).
(3) There is exactly one vertex u such that f(u)=0.
Prove that f(v) is the number of edges in the chain with the fewest edges connecting u and v.
Solution. We prove by induction that f(x)=n if and only if the shortest chain from u to x has n members. This is true for n=0 (and for n=1). Suppose that this holds for 0nk.
Let f(x)=k+1. There exists a vertex y adjacent to x for which h=f(y)<k+1. By the induction hupothesis, y can be connected to u by a chain of h edges, so x can be connected to u by a chain of h+1 edges. Hence, h+1k+1. From these two inequalities, we must have h=k, so x can be connected to u by a chain of k+1 edges. There cannot be a shorter chain, as, by the induction hypothesis, this would mean that f(x) would have to be less than k+1.
Let the shortest chain connecting x to u have k+1 edges. Following along this chain, we can find an element z adjacent to x connected to u by k edges. This must be one of the shortest chains between u and z, so that f(z)=k. By hypothesis (1), f(x) must take one of the values k-1 and k+1. The first is not admissible, since there is no chain with k-1 edges connecting u and x. Hence f(x)=k+1.