Difference between revisions of "2016 USAMO Problems"
(Created page with "==Day 1== ===Problem 1=== Let <math>X_1, X_2, \ldots, X_{100}</math> be a sequence of mutually distinct nonempty subsets of a set <math>S</math>. Any two sets <math>X_i</math>...") |
|||
| Line 17: | Line 17: | ||
===Problem 6=== | ===Problem 6=== | ||
{{problem}} | {{problem}} | ||
| + | |||
| + | {{MAA Notice}} | ||
| + | |||
| + | {{USAMO newbox|year= 2016 |before=[[2015 USAMO]]|after=[[2017 USAMO]]}} | ||
Revision as of 11:20, 26 April 2016
Contents
[hide]Day 1
Problem 1
Let 
be a sequence of mutually distinct nonempty subsets of a set 
. Any two sets 
and 
are disjoint and their union is not the whole set , that is, 
and 
, for all 
. Find the smallest possible number of elements in .
Problem 2
This problem has not been edited in. Help us out by adding it.
Problem 3
This problem has not been edited in. Help us out by adding it.
Day 2
Problem 4
Find all functions 
such that for all real numbers 
and 
, ![\[(f(x)+xy)\cdot f(x-3y)+(f(y)+xy)\cdot f(3x-y)=(f(x+y))^2.\]](http://latex.artofproblemsolving.com/2/d/d/2ddcde1699356cbca5812e17244428064eb74546.png)
Problem 5
This problem has not been edited in. Help us out by adding it.
Problem 6
This problem has not been edited in. Help us out by adding it.
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. 
| 2016 USAMO (Problems • Resources) | ||
| Preceded by 2015 USAMO |
Followed by 2017 USAMO | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
