New problem!
$\left [ 5 \right ]$Let $k,m,n$ be integers such that $1\le n\leq m-1\leq k$. Determine the maximum size of a subset $S$ of the set $\left \{ 1,2,3,...,k \right \}$ such that no $n$ distinct elements of $S$ add up to $m$.
P.S.:This is an ISL problem.
COMBINATORICS MARATHON: SEASON 2
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
Re: COMBINATORICS MARATHON: SEASON 2
HEy, have we forgotten about the marathon?
$\color{blue}{\textit{To}} \color{red}{\textit{ problems }} \color{blue}{\textit{I am encountering with-}} \color{green}{\textit{AVADA KEDAVRA!}}$
- Phlembac Adib Hasan
- Posts:1016
- Joined:Tue Nov 22, 2011 7:49 pm
- Location:127.0.0.1
- Contact:
Re: COMBINATORICS MARATHON: SEASON 2
May be you're right.Look when the marathon started and how many problems it has.Now-a-days many persons are too busy to solve forum's problems.Even I don't have much time like today to type everything what I do all day long or look at forum's problems.
Welcome to BdMO Online Forum. Check out Forum Guides & Rules