Art of Problem Solving
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

1994 USAMO Problems/Problem 5: Difference between revisions

1=2 (talk | contribs)
1=2 (talk | contribs)
Line 6: Line 6:


==See Also==
==See Also==
{{USAMO box|year=1994|num-b=5|after=Last Problem}}
{{USAMO box|year=1994|num-b=4|after=Last Problem}}
{{MAA Notice}}
{{MAA Notice}}
[[Category:Olympiad Combinatorics Problems]]
[[Category:Olympiad Combinatorics Problems]]

Revision as of 07:03, 19 July 2016

Problem

Let $\, |U|, \, \sigma(U) \,$ and $\, \pi(U) \,$ denote the number of elements, the sum, and the product, respectively, of a finite set $\, U \,$ of positive integers. (If $\, U \,$ is the empty set, $\, |U| = 0, \, \sigma(U) = 0, \, \pi(U) = 1$.) Let $\, S \,$ be a finite set of positive integers. As usual, let $\, \binom{n}{k} \,$ denote $\, n! \over k! \, (n-k)!$. Prove that \[\sum_{U \subseteq S} (-1)^{|U|} \binom{m - \sigma(U)}{|S|} = \pi(S)\] for all integers $\, m \geq \sigma(S)$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See Also

1994 USAMO (ProblemsResources)
Preceded by
Problem 4
Followed by
Last Problem
1 2 3 4 5
All USAMO Problems and Solutions

These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions. Error creating thumbnail: Unable to save thumbnail to destination