2023 SSMO Relay Round 2 Problems/Problem 3: Difference between revisions
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
Let <math>T=TNYWR</math>. In a committee of <math>2023</math> people, <math> | Let <math>T=TNYWR</math>. In a committee of <math>2023</math> people, <math>T</math> are scientists and the rest are builders. In order to make a building, <math>\frac{T}{2}</math> people must be choosen with at least one scientist and one builder. If <math>x</math> is the number of ways to do this, find the largest integer <math>a</math> such <math>2^a \mid x</math>. | ||
==Solution== | ==Solution== | ||
Latest revision as of 14:24, 15 September 2025
Problem
Let 
. In a committee of 
people, 
are scientists and the rest are builders. In order to make a building, 
people must be choosen with at least one scientist and one builder. If 
is the number of ways to do this, find the largest integer 
such 
.
