2016 USAMO Problems

Day 1

Problem 1

Let $X_1, X_2, \ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$ . Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$ , that is, $X_i\cap X_{i+1}=\emptyset$ and $X_i\cup X_{i+1}\neq S$ , for all $i\in\{1, \ldots, 99\}$ . Find the smallest possible number of elements in $S$ .

Solution

Problem 2

This problem has not been edited in. If you know this problem, please help us out by adding it.

Problem 3

This problem has not been edited in. If you know this problem, please help us out by adding it.

Day 2

Problem 4

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for all real numbers $x$ and $y$ , $(f(x)+xy)\cdot f(x-3y)+(f(y)+xy)\cdot f(3x-y)=(f(x+y))^2.$

Solution

Problem 5

This problem has not been edited in. If you know this problem, please help us out by adding it.

Problem 6

This problem has not been edited in. If you know this problem, please help us out by adding it.

The problems on this page are copyrighted by the Mathematical Association of America's 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

Page

Toolbox

Search

2016 USAMO Problems

Contents

Day 1

Problem 1

Problem 2

Problem 3

Day 2

Problem 4

Problem 5

Problem 6