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

1985 USAMO Problems/Problem 4: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

2 July 2024

18 July 2016

  • curprev 11:5411:54, 18 July 2016 1=2 talk contribs 553 bytes +553 Created page with "== Problem == There are <math>n</math> people at a party. Prove that there are two people such that, of the remaining <math>n-2</math> people, there are at least <math>\lfloor..."
Retrieved from "https://wiki.aopstest.com/wiki/index.php?title=1985_USAMO_Problems/Problem_4"