Difference between revisions of "2005 Alabama ARML TST Problems/Problem 12"
(New page: ==Problem== Find the number of ordered pairs of positive integers <math>(a,b,c,d)</math> that satisfy the following equation:<center><math>a+b+c+d=12</math>.</center> ==Solution== The [[G...) |
(→See also) |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 2: | Line 2: | ||
Find the number of ordered pairs of positive integers <math>(a,b,c,d)</math> that satisfy the following equation:<center><math>a+b+c+d=12</math>.</center> | Find the number of ordered pairs of positive integers <math>(a,b,c,d)</math> that satisfy the following equation:<center><math>a+b+c+d=12</math>.</center> | ||
+ | __TOC__ | ||
==Solution== | ==Solution== | ||
− | The [[ | + | === Solution 1 === |
+ | The [[generating function]] for <math>a, b, c,</math> and <math>d</math> is <math>x+x^2+x^3+\cdots</math>. | ||
− | < | + | <cmath>(x+x^2+x^3+\cdots)^4=x^4(1+x+x^2+x^3)^4= x^4+{4\choose 3}x^5+{5\choose 3}x^6+\cdots</cmath> |
− | + | The coefficient of <math>x^{12}</math> is <math>\binom{3+12-4}{3}=165</math>. | |
− | <math>\ | + | === Solution 2 === |
+ | We consider a [[bijection]] to the following combinatorial argument. Suppose we have twelve balls and we would like to put them into four urns. There is a positive number of balls in each urn, so we put one ball into each urn initially. We are left with eight balls to go into four urns, which is equivalent to have three dividers. Thus there are <math>\frac{11!}{8!3!} = 165</math> ordered pairs. | ||
− | + | ==See also== | |
+ | {{ARML box|year=2005|state=Alabama|num-b=11|num-a=13}} | ||
+ | <center>[[2006 Alabama ARML TST Problems/Problem 9|A similar problem]]</center> | ||
− | + | [[Category:Intermediate Combinatorics Problems]] | |
− | |||
− | |||
− | |||
− |
Latest revision as of 08:56, 18 June 2008
Problem
Find the number of ordered pairs of positive integers that satisfy the following equation:
Contents
[hide]Solution
Solution 1
The generating function for and is .
The coefficient of is .
Solution 2
We consider a bijection to the following combinatorial argument. Suppose we have twelve balls and we would like to put them into four urns. There is a positive number of balls in each urn, so we put one ball into each urn initially. We are left with eight balls to go into four urns, which is equivalent to have three dividers. Thus there are ordered pairs.
See also
2005 Alabama ARML TST (Problems) | ||
Preceded by: Problem 11 |
Followed by: Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 |