Difference between revisions of "1995 IMO Problems/Problem 6"
Tigerzhang (talk | contribs) (Created page with "Let <math>p</math> be an odd prime number. How many <math>p</math>-element subsets <math>A</math> of <math>{1,2,\ldots,2p}</math> are there, the sum of whose elements is divis...") |
m |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| + | ==Problem== | ||
Let <math>p</math> be an odd prime number. How many <math>p</math>-element subsets <math>A</math> of <math>{1,2,\ldots,2p}</math> are there, the sum of whose elements is divisible by <math>p</math>? | Let <math>p</math> be an odd prime number. How many <math>p</math>-element subsets <math>A</math> of <math>{1,2,\ldots,2p}</math> are there, the sum of whose elements is divisible by <math>p</math>? | ||
| + | |||
| + | ==Solution== | ||
| + | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | {{IMO box|year=1995|num-b=5|after=Last Question}} | ||
Latest revision as of 20:39, 4 July 2024
Problem
Let 
be an odd prime number. How many -element subsets 
of 
are there, the sum of whose elements is divisible by ?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 1995 IMO (Problems) • Resources | ||
| Preceded by Problem 5 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Last Question |
| All IMO Problems and Solutions | ||
