Difference between revisions of "2023 IOQM/Problem 25"

(Question Added)
(Question Added)
 
Line 1: Line 1:
Q.25 Find the least positive integer n such that there are at least 1000 unordered pairs of diagonals in a regular polygon with n vertices that intersect at a right angle in the interior of the polygon.
+
Problem 25
 +
Find the least positive integer n such that there are at least 1000 unordered pairs of diagonals in a regular polygon with n vertices that intersect at a right angle in the interior of the polygon.

Latest revision as of 14:08, 3 September 2024

Problem 25 Find the least positive integer n such that there are at least 1000 unordered pairs of diagonals in a regular polygon with n vertices that intersect at a right angle in the interior of the polygon.