Circumscribed Quadrilateral with Integer Sides and Radius

  • Level: Undergrad 
  • Thread starter bob012345
  • Start date
13 replies · 574 views · last reply
bob012345
Gold Member
Messages
2,486
Reaction score
1,143
TL;DR
A 4 sided polygon is inscribed in a circle. The chord lengths are all distinct integers . Find the smallest possible integer radius of the circle and the length of the sides.
This is an offshoot of @Charles Link ’s problem; Consider again a 4 sided polygon inscribed in a circle. The chord lengths are all distinct integers ##a<b<c<d##. Find the smallest possible integer radius ##r## of the circle and the length of the sides.

 
anuttarasammyak said:
Addendum
0,0,0,0 gives r=0. 0,0,2,2 gives r=1.
The side lengths must all be different as per the instructions in post #1.
 
Charles Link said:
One that I have is 2,7, 11, and 14 with r=7. Probably not the smallest.
I believe it is in fact the smallest integer radius with four different sides. If we take away that restriction the smallest is (1,1,1,2) with ##r=1##. The figure for that is half a hexagon within the circle. In your case, one of the sides was the diameter. If we ask now what is the smallest possible integer radius with four unique integer sides but not allowing one side to be a diameter, what do we get? I believe @anuttarasammyak is on the right track.
 
  • Like
Likes   Reactions: anuttarasammyak and Charles Link
anuttarasammyak said:
Addendum
0,0,0,0 gives r=0. 0,0,2,2 gives r=1.
Zerogon.webp
Shown on the right is the quadrilateral (0,0,0,0) with ##R=0.##
 
  • Like
  • Haha
Likes   Reactions: bob012345 and Charles Link
bob012345 said:
I believe it is in fact the smallest integer radius with four different sides. If we take away that restriction the smallest is (1,1,1,2) with ##r=1##. The figure for that is half a hexagon within the circle. In your case, one of the sides was the diameter. If we ask now what is the smallest possible integer radius with four unique integer sides but not allowing one side to be a diameter, what do we get? I believe @anuttarasammyak is on the right track.
Try 14,30,40, and 48 with r=25.
 
  • Like
Likes   Reactions: anuttarasammyak and bob012345
Charles Link said:
One that I have is 2,7, 11, and 14 with r=7. Probably not the smallest.
There are 431 cases for
$$d<a+b+c$$  $$1 \leq a < b< c< d \leq 12$$
1795180129218.webp

1795180186272.webp

No case has integer r.
@Charles Link you have got the smallest. How have you got it ?
 
Last edited:
Last edited:
There is an intriguing case for ##r=7## reminiscent of the case where ##x=(3,\frac{1}{23})## in the previous thread except both integers. Can anyone find it?
 
bob012345 said:
There is an intriguing case for ##r=7## reminiscent of the case where ##x=(3,\frac{1}{23})## in the previous thread except both integers. Can anyone find it?
HINT: You have to drop the requirement that all sides be different.