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

(Created page with "==Problem== Let <math>m>2</math> be an integer, <math>A</math> be a finite set of (not necessarily positive) integers, and <math>B_1,B_2,B_3,...,B_m</math> be subsets of <math...") |
|||

(One intermediate revision by the same user not shown) | |||

Line 1: | Line 1: | ||

==Problem== | ==Problem== | ||

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

==Video solution== | ==Video solution== | ||

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

## Latest revision as of 00:57, 2 August 2021

## Problem

Let be an integer, be a finite set of (not necessarily positive) integers, and be subsets of . Assume that for each the sum of the elements of is . Prove that contains at least elements.

## Video solution

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