If you can buy 1⁄3 of a box of chocolates for 6 dollars, how much can you purchase for 4 dollars? Write your answer as a fractio
2 answers:
Answer:
of a box of chocolate .
Step-by-step explanation:
Given : you can buy 1⁄3 of a box of chocolates for 6 dollars,
To find : how much can you purchase for 4 dollars.
Solution : We have given that
For 6 dollars we can buy = of a box.
For 1 dollar we can buy = ÷ 6.
For 4 dollar we can buy = ×4
= of a box of chocolate .
Therefore, of a box of chocolate .
You might be interested in
Answer:
Step-by-step explanation:
Given
Required [Missing from the question]
G(T(x))
We have:
This implies that:
Substitute:
Open bracket
The number of possibilities for constructing the 4 characters long password with specified conditions is given by: Option C: 703,040
<h3>What is the rule of product in combinatorics?</h3>If a work A can be done in p ways, and another work B can be done in q ways, then both A and B can be done in ways.
Remember that this count doesn't differentiate between order of doing A first or B first then doing other work after the first work.
Thus, doing A then B is considered same as doing B then A
We're specified that:
- The password needs to be 4 characters long
- It must have 3 letters and 1 of 10 special characters.
- Repetition is allowed.
So, each of 3 characters get 26 ways of being 1 letter. (assuming no difference is there between upper case letter and lower case letter).
And that 1 remaining character get 10 ways of being a special character.
So, by product rule, this choice (without ordering) can be done in:
ways.
Now, the password may look like one of those:
- L, L, L, S
- L, L, S, L
- L, S, L, L
- S, L, L, L
where S shows presence of special character and L shows presence of letter.
Those 175760 ways are available for each of those four ways.
Thus, resultant number of ways this can be done is:
Thus, the number of possibilities for constructing the 4 characters long password with specified conditions is given by: Option C: 703,040
Learn more about rule of product here: