1980 USAMO Problems/Problem 2: Difference between revisions
Created page with "== Problem == Find the maximum possible number of three term arithmetic progressions in a monotone sequence of <math>n</math> distinct reals. == Solution == {{solution}} == See..." |
No edit summary |
||
| Line 7: | Line 7: | ||
== See Also == | == See Also == | ||
{{USAMO box|year=1980|num-b=1|num-a=3}} | {{USAMO box|year=1980|num-b=1|num-a=3}} | ||
{{MAA Notice}} | |||
[[Category:Olympiad Number Theory Problems]] | [[Category:Olympiad Number Theory Problems]] | ||
Revision as of 18:10, 3 July 2013
Problem
Find the maximum possible number of three term arithmetic progressions in a monotone sequence of 
distinct reals.
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1980 USAMO (Problems • Resources) | ||
| Preceded by Problem 1 |
Followed by Problem 3 | |
| 1 • 2 • 3 • 4 • 5 | ||
| All USAMO Problems and Solutions | ||
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination
