Consider all sets of 4 points A , B , C , D which satisfy the following conditions:
Over all such sets, what is max ⌈ B D ⌉ ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Given all of the discussion, can you update the solution to reflect what you have learnt?
I believe that B D = 1 3 cannot be achieved.
It is not clear to me what is happening here.
I don't get this. Why does x + 4 1 1 have to be an integer?
Clearly, n = 1 3 isn't the solution, as Mr Mendrin demonstrated: There is no quadrilateral with dimensions 7 , 8 , 9 , 1 0 ; 1 1 , 1 3
Log in to reply
Of course, sir, those dimensions do not exist. That's why I adjusted 13 to be the least upper bound of B D instead.
Log in to reply
But if you drop the condition of the diagonal BD being of integer length, then you can make it as long as you wish by making AB as long as you wish... there is no upper bound.
I'm afraid this problem still makes little sense.
Log in to reply
@Otto Bretscher – Well, sir, but if we retain the condition of the least upper bound B D being the integer (instead of the diagonal B D itself), shouldn't the solution be unique in Ptolemy's inequality?
Log in to reply
@Worranat Pakornrat – I'm afraid not. The larger you make AB, the larger BD will be... it will grow without bound.
Log in to reply
@Otto Bretscher – That I agree, but for example, if A B = 1 0 0 0 , then B D ≤ ( 1 0 0 0 ∗ 1 0 0 2 + 1 0 0 1 ∗ 1 0 0 3 ) / 1 0 0 4 = 2 0 0 6 0 0 3 / 1 0 0 4 .
This least upper bound is not an integer in Ptolemy's inequality. My point is, there may be countless possibilities for B D ; however, I'm trying to point out that there is only one least upper bound which turns out to be the integer in Ptolemy's inequality.
Log in to reply
@Worranat Pakornrat – Well, a least upper bound of the diagonal BD simply does not exist, integer or not..think about it (bed time for me... I hope this is all cleared up when I wake up in the morning ; )
Log in to reply
@Otto Bretscher – Well, what if we define it as "supremum" then, sir?
Log in to reply
@Worranat Pakornrat – As I have just commented in the reports section, there is only one cyclic quadrilateral with sides a , b , c , d with b = a + 1 , c = a + 2 , d = a + 3 and matching diagonal p = a + 4 , and that does not have integer sides. You cannot make q = B D arbitrarily big - the only value it can take is about 9 . 6 4 6 6 1 . Thus the least upper bound of B D does exist, since there is only one value that it can take, and that value is not 1 3 .
Noting that the question has removed the requirement for cyclicity, we can make the following observations. There is a unique convex quadrilateral with sides a , b , c , d with b = a + 1 , c = b + 1 , d = c + 1 and matching diagonal p = d + 1 for any integer a > 3 (the triangles A B C and A C D are unique). For this quadrilateral cos ∠ B A C = 2 a ( a + 4 ) a 2 + 6 a + 1 5 cos ∠ C A D = 2 ( a + 4 ) a + 7 Both of these cosines tend to 2 1 as a → ∞ and hence both angles tend to 6 0 ∘ as a → ∞ . Thus, for large enough a , both angles are greater than 4 5 ∘ , and hence ∠ B A D > 9 0 ∘ . Since the triangle B A D is obtuse-angled, it is clear that B D > a . Since a can increase without limit, so can B D . Indeed, since the triangles A B C and A C D will become increasingly closer to being equilateral as a → ∞ , the diagonal B D will be approximately a 3 for large a .
Thus the diagonal B D has no supremum.
Your new proposed solution contains big logical problems. Once you move from equalities to inequalitities, your ability to deduce that (in your notation) x + 4 divides 1 1 is gone. In addition, just because there exist numbers a , b , c , d , p , q such that p q = a c + b d does not mean that a quadrilateral exists with these numbers as edge and diagonal lengths.
Log in to reply
@Mark Hennings – OK, I think this time it will make everyone happy.
@Otto Bretscher – Hm...how about we look at it this way? Let A be the set of the segment ratios and set B i be the set of possible values of B D as shown below and N be the set of natural numbers and A B = x .
A = { x + 4 2 x 2 + 6 x + 3 : x ∈ N ; x > 0 }
Let a i be the element in set A and B i = { b ∈ R + : b < a i }.
Thus, s u p ( B i ) = a i .
There is only one element in A that is an integer, so there is only one supremum of B that is an integer: s u p ( B 7 ) = 1 3 .
Log in to reply
@Worranat Pakornrat – You are overthinking this problem; the situation is really quite simple, requiring only grammar school geometry. For every large positive integer x there exists a unique convex quadrilateral with A B = x , B C = x + 1 , C D = x + 2 , A D = x + 3 and A C = x + 4 : Just start with A C and then construct the sides. I keep repeating myself: As we let x grow without bound, B D will grow without bound as well.
In my humble opinion this question still does not make sense. As we have discussed at length, there are only two quadrilaterals with the required properties, one of them convex with a "long(er)" diagonal B D . The length of B D in the convex case is easy to compute with basic geometry; it is 1 2 < B D < 1 3 . It makes little sense to ask for some hypothetical "supremum" of B D that is not actually attained in any quadrilateral.
One way to salvage the problem is this: Keep the question and the answer as is, but ask at the end: "... what is the least integer upper bound of the diagonal B D ?" This would make the problem somewhat interesting and meaningful, although perhaps not in the way you intended.
The way the problem is now phrased, we need to show that there exists such a quadrilateral with B D > 1 2 .
Solving a biquadratic equation, we can see that the two possible values of B D are 1 1 1 1 0 6 0 9 ± 4 8 0 3 9 0 . The larger one, in the convex quadrilateral, is about 12.8848, showing that the least integral upper bound is indeed 13.
Log in to reply
OK, the author has found a question which has an answer of 1 3 .
The length B D of the only convex quadrilateral that satisfies the conditions is 1 2 . 8 8 .
The question would be much better if it stated that the rectangle was convex, and simply asked for the ceiling ⌈ B D ⌉ , rather than the rather clumsy "least integral upper bound of B D ", given that there is only one value for B D under these conditions.
Log in to reply
I must confess that I rather like the way the problem is now phrased. At the very least, it seems formally correct.
Finding out that there are only two solutions (and only one convex one) is a big part of the problem, involving some algebra (to get to A B = 7 and then some geometry. We might be giving too much away if we ask for the ceiling of the convex solution right away.
The term "least integral upper bound" is pretty widely used (I did a google search); whether it is clumsy is a matter of taste. Remember that most of us are not native English speakers, so, things might sound different to our ears.
Given a cyclic quadrilateral of successive sides 7,8,9,10, the lengths of the diagonals are actually 7 3 1 0 1 5 3 = 1 1 . 7 9 3 3 . . . and 7 1 1 0 4 3 9 = 1 2 . 1 2 5 5 . . . , not 1 1 and 1 3 .
I don't know of a good way to fix this problem. If Ptolemy actually created such a cyclic quadrilateral, maybe we should have another look at what he did or said?
Since the discussion of this problem is already detailed, I will add the report I have just posted...
This quadrilateral cannot exist. Suppose there were a cyclic quadrilateral A B C D with integer sides A B = a , B C = b , C D = c , D A = d with b = a + 1 , c = a + 2 , d = a + 3 , as well as integer diagonals A C = p , B D = q with p = a + 4 . Then Ptolemy's First Theorem would tell us that ( a + 4 ) q = p q = a c + b d = a ( a + 2 ) + ( a + 1 ) ( a + 3 ) = 2 a 2 + 6 a + 3 and hence a + 4 must divide 2 a 2 + 6 a + 3 = 2 ( a + 4 ) ( a − 1 ) + 1 1 , so that a + 4 must divide 1 1 . Since a is a positive integer and 1 1 is prime, it follows that a = 7 , b = 8 , c = 9 , d = 1 0 , p = 1 1 and hence q = 1 3 .
However, the triangles A B C and A C D should share the same circumcircle as the cyclic quadrilateral A B C D . A triangle with sides u , v , w has circumradius R = ( u + v + w ) ( u + v − w ) ( u + w − v ) ( v + w − u ) u v w Since A B C has sides 7 , 8 , 1 1 , it has circumradius 1 9 5 7 7 . Since A C D has sides 9 , 1 0 , 1 1 , it has circumradius 4 2 3 3 . Thus the circumcircles of A B C and A C D are not the same, and hence A B C D is not cyclic.
If we consider a quadrilateral with sides a , b = a + 1 , c = a + 2 , d = a + 3 and diagonal p = a + 4 , then cos B cos D = = 2 a ( a + 1 ) a 2 + ( a + 1 ) 2 − ( a + 4 ) 2 = 2 a ( a + 1 ) a 2 − 6 a − 1 5 2 ( a + 2 ) ( a + 3 ) ( a + 2 ) 2 + ( a + 3 ) 2 − ( a + 4 ) 2 = 2 ( a + 2 ) ( a + 3 ) a 2 + 2 a − 3 If we want A B C D to be cyclic, then B + D = 1 8 0 ∘ , and hence cos B + cos D 2 a ( a + 1 ) a 2 − 6 a − 1 5 + 2 ( a + 2 ) ( a + 3 ) a 2 + 2 a − 3 ( a 2 − 6 a − 1 5 ) ( a + 2 ) ( a + 3 ) + ( a 2 + 2 a − 3 ) a ( a + 1 ) a 4 + a 3 − 2 0 a 2 − 5 7 a − 4 5 ( a + 3 ) ( a 3 − 2 a 2 − 1 4 a − 1 5 ) a 3 − 2 a 2 − 1 4 a − 1 5 = = = = = = 0 0 0 0 0 0 since a must be positive. There is a unique real solution to this cubic equation, but the value of a ≈ 5 . 2 3 is irrational.
We could salvage this problem by dropping the requirement for integer side lengths, and looking for the value a = 5 . 2 3 .
Log in to reply
Thank you for your solution. I hope the new wording can help preserve the problem's contents.
In reference to the first part of your post (before the figure), it is worth pointing out that a quadrilateral with the dimensions we want (7,8,9,10; 11,13) does not exist at all, cyclic or not.
Could you please show us how you achieved these diagonals?
Log in to reply
The formulas for the length of the diagonals can be found here
Great observation, Mr Mendrin!
Log in to reply
Well, as I've noted in the View Reports section, what interests me about this problem is how easy it was to come to a fallacious conclusion. As how I imagine Worranat is wondering, "What went wrong?" Where did he go off the rails? I think the best way I can try to answer that is that if the quadrilateral is cyclic, and given the lengths of its four sides, then both diagonals are already fixed, and all we know about them is that the product follows Ptolemy's Theorem. Working them out is another matter. If we relax the condition that the quadrilateral is cyclic, then Ptolemy's Theorem cannot be used to find out anything, but fixing any one diagonal will uniquely determine the other.
Log in to reply
Looked at another way, it is a matter of reading implications. A cyclic quadrilateral has to satisfy Ptolemy's Theorem, but satisfying the equation of Ptolemy's Theorem does not guarantee a cyclic quadrilateral (a set of numbers a , b , c , d , p , q that satisfy the equation in Ptolemy's Theorem does not have to correspond to an quadrilateral, cyclic or otherwise). The quadrilateral intended by the author does not satisfy Ptolemy's Second Theorem, which is another way of showing the problem to be wrong.
Log in to reply
@Mark Hennings – Your statement is misleading: A quadrilateral that satisfies Ptolemy's Theorem does indeed have to be cyclic.
Log in to reply
@Otto Bretscher – Observe the bracketed clarification (added before your post). I stated that numbers that satisfy the equation do not have to define a cyclic quadrilateral - vide 7,8,9,10,11,13.
Log in to reply
@Mark Hennings – Still, your statement that "a quadrilateral that satisfies Ptolemy's Theorem does not have to be cyclic" is false; it's hard to clarify a false statement ;) The "clarification" would be clearer if you said "...does not have to correspond to an actual quadrilateral", dropping "cyclic".
@Mark Hennings – My apology for my mistake. I hope the new wording will help preserve the problem's contents and be more satisfying.
Thank you for your solution. I hope the new wording can help preserve the problem's contents.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Ptolemy's Theorem
According to Ptolemy's theorem, for any quadrilateral, the product of the diagonals will be less than or equal to the sums of the products of the opposite sides:
( A B × C D ) + ( B C × D A ) ≥ A C × B D
Now let A B = x and B D = n for some positive integers x & n .
Then x ( x + 2 ) + ( x + 1 ) ( x + 3 ) ≥ ( x + 4 ) n .
n ( x + 4 ) ≤ x 2 + 2 x + x 2 + 4 x + 3 = 2 x 2 + 6 x + 3
n ≤ x + 4 2 x 2 + 6 x + 3 = ( 2 x − 2 ) + x + 4 1 1
Since n & x are positive integers, x + 4 1 1 must also be an integer. Thus, x = 7 .
As a result, n ≤ ( 1 4 − 2 ) + 1 = 1 3 .
Therefore, the upper bound of B D is 1 3 in such constraints.