Art of Problem Solving
Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2023 IOQM/Problem 25: Difference between revisions

← Older edit
Meolve (talk | contribs)
editor
4 edits
Question Added
Meolve (talk | contribs)
editor
4 edits
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.

Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=2023_IOQM/Problem_25&oldid=226323"