2025 USAMO Problems/Problem 6

Problem

Let $m$ and $n$ be positive integers with $m\geq n$ . There are $m$ cupcakes of different flavors arranged around a circle and $n$ people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person $P$ , it is possible to partition the circle of $m$ cupcakes into $n$ groups of consecutive cupcakes so that the sum of $P$ 's scores of the cupcakes in each group is at least $1$ . Prove that it is possible to distribute the $m$ cupcakes to the $n$ people so that each person $P$ receives cupcakes of total score at least $1$ with respect to $P$ .

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

2025 USAMO (Problems • Resources)
Preceded by Problem 5	Followed by Last Problem
1 • 2 • 3 • 4 • 5 • 6
All USAMO Problems and Solutions

Page

Toolbox

Search

2025 USAMO Problems/Problem 6

Contents

Problem

Solution

See Also