Kamau wants to get change for a sh 1000 note. The Change is to consist of sh 500, sh 200, sh 100, and sh 50 notes. What is the smallest number of notes he can get?
2x500 = 1000
Now, if it must contain some of each note, then
1x500
1x200
2x100
2x50
Not understood well
To find the smallest number of notes Kamau can get, we need to determine the optimal combination of sh 500, sh 200, sh 100, and sh 50 notes that equals sh 1000.
Let's start with the highest denomination note, sh 500. Since sh 500 is the largest note, Kamau can only get a maximum of 2 sh 500 notes from sh 1000.
Remaining amount: sh 1000 - (2 * sh 500) = sh 1000 - sh 1000 = sh 0
Now, let's move to the next highest denomination note, sh 200. Since there is no remaining amount after using the sh 500 notes, Kamau cannot obtain any sh 200 notes.
Next, let's calculate the sh 100 notes. Again, Kamau cannot get any sh 100 notes because there is no remaining amount after using the sh 500 notes.
Finally, let's consider the sh 50 notes. Since there is no remaining amount, Kamau cannot obtain any sh 50 notes.
In conclusion, the smallest number of notes Kamau can get to make change for a sh 1000 note is only 2 sh 500 notes.
To find the smallest number of notes Kamau can get as change, we need to divide the amount he wants to change (sh 1000) by the highest denomination note available (sh 500) and check if there is any remainder.
Let's go step by step:
1. Divide sh 1000 by sh 500:
- sh 1000 / sh 500 = 2
This means Kamau can get 2 sh 500 notes.
2. Check if there is any remainder:
- sh 1000 % sh 500 = 0
Since the remainder is 0, we don't need to consider any smaller denominations.
Therefore, Kamau can get his change in just 2 notes, which are sh 500 notes.