Difference between revisions of "2021 IMO Problems/Problem 6"

 
Line 8: Line 8:
 
{{IMO box|year=2021|num-b=5|after=Last Problem}}
 
{{IMO box|year=2021|num-b=5|after=Last Problem}}
  
[[Category:Olympiad Combinatorics Problems]]
+
[[Category:Olympiad Algebra Problems]]

Latest revision as of 09:44, 18 June 2023

Problem

Let $m \ge 2$ be an integer, $A$ be a finite set of (not necessarily positive) integers, and $B_1, B_2, B_3 , \ldots, B_m$ be subsets of $A$. Assume that for each $k = 1, 2,...,m$ the sum of the elements of $B_k$ is $m^k$. Prove that $A$ contains at least $m/2$ elements.

Video solution

https://youtu.be/vUftJHRaNx8 [Video contains solutions to all day 2 problems]

See also

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