Olympiad problems

AND:

OR:

NO:

Found problems: 2

First
Previous
1
Next
Last

2006 Lithuania National Olympiad, 4

Tags: subset , combinatorics , cardinality , set , uniqueness

Find the maximal cardinality $|S|$ of the subset $S \subset A=\{1, 2, 3, \dots, 9\}$ given that no two sums $a+b | a, b \in S, a \neq b$ are equal.

2000 Junior Balkan Team Selection Tests - Romania, 1

Tags: uniqueness , number theory , modular arithmetic

For each $ k\in\mathbb{N} ,k\le 2000, $ Let $ r_k $ be the remainder of the division of $ k $ by $ 4, $ and $ r'_k $ be the remainder of the division of $ k $ by $ 3. $ Prove that there is an unique $ m\in\mathbb{N} ,m\le 1999 $ such that $$ r_1+r_2+\cdots +r_m=r'_{m+1} +r'_{m+2} +\cdots r'_{2000} . $$ [i]Mircea Fianu[/i]

First
Previous
1
Next
Last