A circle can be divided into 2 sections, by placing 2 points in arbitrary locations along its circumference and drawing a straight line between them. By adding more points and drawing a straight line from each point to every other point, the circle can be divided into more sections. For example, 3 points would divide the circle into 4 sections and 4 points into 8 sections.
Given a positive integer, n, representing the number of arbitrarily placed points on the circumference of a circle, return d, i and s, the number of straight lines, the number of intersections and the number of sections into which the circle is divided, respectively.
The only restriction on the positions of the points is that they must be placed such that no 3 lines can share a single intersection.
n will always be greater than 3.
Example:
n = 4;
d = 6
i = 1
s = 8
Example:
n = 5;
d = 10
i = 5
s = 16
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Return the largest number that is adjacent to a zero
5549 Solvers
-
411 Solvers
-
1795 Solvers
-
Sum the numbers on the main diagonal
620 Solvers
-
6000 Solvers
More from this Author45
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!