Performance Task in Mathematics: Third Quarter 

How Much is in the Piggy Bank?

Submitted by:
GROUP 6 (X - SOLRAD)
MEMBERS:
APIGO, Kyla Angel A.
DE VERA, Hannah Isabelle S.
MANZANARES, Pauline L.
PRUDENTE, Krystal Faith S.
SABLAY, Franchine Samantha B.

Submitted to:
Mr. Reynaldo Santos
Real-World Problem:

1. Suppose you are a student council member and your group has decided to have a
feeding program for street children as part of your outreach work. The student council
members agreed to save up for this project by depositing twenty-, fifty-, or one
hundred-peso bills into a piggy bank. One day, the student council members decided to
figure out, without breaking open the piggy bank, what the possible denominations in the
piggy bank are saved till now. All that is known is that there are 10 bills in the piggy
bank. Using your knowledge in counting techniques discussed in class, write a list of all
possible denominations in the piggy bank. ​How many possibilities are there? (Note: It
is possible that no twenty-peso bills or any of the other two denominations were
deposited into the piggy bank.) You may want to use ​MS Excel worksheets to generate
the list so that calculations will not be too tedious. Just for fun, the student council
members try to guess what the total amount of the 10 bills are. Here are some of the
guesses: ​₱500, ₱650, ₱350, ₱580, ₱300, ₱470, and ₱410. Looking at the list of the
possible denominations in the piggy bank that your group has generated, w ​ hich of
these following guesses are poor guesses (i.e. guesses that are not possible)?

2. Go to the internet and research on the generalized combinations from a set of n

elements when repetitions are allowed. You can also use books in combinatorics or
discrete mathematics for your research. Find out if there is a closed formula to use in this
case. Apply the information you have gathered from your research to answer this
question. ​What if your piggy bank has 30 bills in it, how many possible amounts
are there for the sum of the 30 bills? ​Can the performance task be modeled by the
following problem:
How many solutions does the equation x + y + z = 30 have, where x,y, and z
are non-negative integers? You also need to present your findings using ​Powerpoint.​
The research portion should be submitted as a written report using ​MS Word​. You
should also include the portion of your research that is needed to solve the performance
task in your Powerpoint presentation. Divide the work among your team members.
1. ​Answer:
There are 66 possible denominations in the piggy bank when manually calculated or
using the formula C(n+r-1, n-1) for combination with repitition.
(n=3, r = 10)
(n + r − 1)!
c(12, 2) = r!(n−1)!
12!
= 10!(2)!
= 66 possible denominations

Based on our computation, the only guess that is not possible is ₱300.

2. ​Answer:
From ‘Discrete Mathematics and Its Applications, 7th Edition, Rosen’, it states that:

"THEOREM 2: There are (n+r−1 ,r) = (n+r−1, n−1) r-combinations from a set with n elements
when repetition of elements is allowed.

Proof: Each r-combination of a set with n elements when repetition is allowed can be
represented by a list of n−1 bars and r stars. The n−1 bars are used to mark off n different cells,
with the i-th cell containing a star for each time the ith element of the set occurs in the
combination. For instance, a 6-combination of a set with four elements is represented with three
bars and six stars. Here ∗∗|∗||∗∗∗ represents the combination containing exactly two of the first
element, one of the second element, none of the third element, and three of the fourth element
of the set. As we have seen, each different list containing n−1 bars and r stars corresponds to
an r-combination of the set with n elements, when repetition is allowed. The number of such lists
is (n−1+r, r), because each list corresponds to a choice of the r positions to place the r stars
from the n−1+r positions that contain r stars and n−1 bars. The number of such lists is also
equal to (n−1+r, n−1), because each list corresponds to a choice of the n−1 positions to place
the n−1 bars.​”

From this information, Our group can calculate the number of possible denominations in a piggy
bank that contains 30 bills which can only be twenty-, fifty-, or one hundred-peso bill using this
formula − (n+r−1 ,n-1). Hence, an r = 30-combination from a set of size n = 3 should be equal to
C(32,2)

(n = no. of objects which combination is formed; r = no. of objects used to form permutation)

(n + r − 1)!
c(32, 2) = r!(n−1)!
32!
= 30!(2)!
= 496 possible denominations
 According to math.northwestern.edu (Northwestern University Department of
Mathematics) combinations with repetition can also be expressed in x1 + x2 +x3 or x + y + z
equations:

“The number of non-negative integer solutions of the equation:

x1 + x2 + ... + xn = r

Example: Assume that we have 3 different (empty) milk containers and 7 quarts of milk that we
can measure with a one-quart measuring cup. In how many ways can we distribute the milk
among the three containers? We solve the problem in the following way. Let x1, x2, x3 be the
quarts of milk to put in containers numbers 1, 2 and 3 respectively. The number of possible
distributions of milk equals the number of non-negative integer solutions for the equation x1 + x2
+ x3 = 7. Instead of using numbers for writing the solutions, we will use strokes, so for instance
we represent the solution x1 = 2, x2 = 1, x3 = 4, or 2 + 1 + 4, like this: ||+|+||||. Now, each
possible solution is an arrangement of 7 strokes and 2 plus signs, so the number of
arrangements is P(9; 7, 2) = 9!/7! 2! = ( 9;7)

(n + r − 1)!
The general solution is: P (n + r − 1; r, n − 1) = r! (n−1)!
”

T​herefore, we could also express the given to the equation x1 + x2 +x3 =30 or x + y + z = 30.
(n + r − 1)!
From the given formula ( r! (n−1)! ), t​he equation x + y + z = 30 has 496 possible solutions
accordingly.

(n = no. of objects which combination is formed; r = no. of objects used to form permutation)

(n + r − 1)!
P (3 + 30 − 1; 3 − 1) = r! (n−1)!
32!
= 30!(2)!
= 496 possible denominations