Pick two points at random on the circumference of a circle. What is the probability that the chord drawn between the two points is greater in length than the radius? Just click on the green flag to determine an experimental answer to the question. Do not use Turbo as it hides the process. The script uses the Monte Carlo method of selecting 1000 chords of the circle at random and then computing the fraction of those 1000 chords that are longer than the radius of the circle. There is a theoretical solution to this question. This project is a warmup project helpful for attacking the Joseph Bertrand Chord Paradox Problem. I will do this in three future projects.
I used the parametric equation for a circle(x = radius x cos [angle], y = radius x sin [angle]) to draw a circle of radius 100. Then, on the background, I used the vector option to size a vector circle to the project-drawn circle. I then deleted the script that drew the circle. This shortened the code so that just the chord had to be repeatedly drawn. The code shows how to compute the length of the chord (using the Pythagorean theorem) knowing the (x,y) coordinates of the endpoints of the chord.
