Circumscribed Quadrilateral with Integer Sides and Radius.

  • Level: Undergrad 
  • Thread starter bob012345
  • Start date
5 replies · 206 views · last reply
bob012345
Gold Member
Messages
2,483
Reaction score
1,141
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:
1,2,3,4 if 1,1,1,1 is excluded.
What is the radius?
 
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.
 
Making use of small primitive Pythagoras numbers, i.e.,
$$3^2+4^2=5^2$$
$$5^2+12^2=13^2$$
Set 50,78,104,120 gives r=65