Yahoo Answers is shutting down on May 4th, 2021 (Eastern Time) and beginning April 20th, 2021 (Eastern Time) the Yahoo Answers website will be in read-only mode. There will be no changes to other Yahoo properties or services, or your Yahoo account. You can find more information about the Yahoo Answers shutdown and how to download your data on this help page.
Trending News
how do you find x,y,z?
suppose that cool tech corporation makes wigets, gidgets and sprockets. while all 3 items get the same indivisual packing, they all witgh different amounts. including the packaging, they all wigh different amounts. including thr packaging. widgets weigh 3 ounces. gigets are 4 ounces and sprockets are 5 ounces. the shipping box used can only hold 30 packaged items, and they will have to pay extra shipping if the total weight is above 96 ounces.
1. how many ways can shipping boxes be filled that will make use of the full 96 ounces and full 30 items that they can fit without going over 96 ounes
2. list all possible ways to pack the boxes if you guarentee that each store will get atleast 1 of all 3 parts
2 Answers
- Anonymous8 years agoFavorite Answer
(1) If w is the number of widgets, g the number of gigets and s the number of sprockets we have then
(a) w+g+s=30 and
(b) 3w+4g+5s=96
From (a) we get w=30-g-s and, replacing in (b) and simplifying we get
g+2s=6
From where we get
s = (6-g)/2 = 3 - (g/2)
As w, g and s are integers >=0, it follows that g has to be even and the 4 possible solutions are:
g=0, s=3, w=30-0-3=27
g=2, s=2, w=26
g=4, s=1, w=25
g=6, s=0, w=24
(2) If we are still saying that we have to make use of the full 96 ounces and 30 items then the answer is 2, as those are the only answers amongst the ones above for each all variables are positive.
However, in the more interesting case where we are just interested in all possible ways to pack where the number of items is at most 30 and the weight is at most 96, then they can be counted (using a spreadsheet) as follows:
Consider 3 columns headed w, g and s.
On the first row, under the headings, make w(1)=1, g(1)= 1 and s(1) = INT ( (96-3*w(1)-4*g(1))/5 )
Then you will get s(1)=17 and this is the maximum number of sprockets you can get if you have 1 widget and 1 giget. Clearly you could have any number of sprockets from 1 to 17, so there are 17 possibilities with 1 widget and 1 sprocket
Now for the rows below make w(i+1) = w(i) if s(i)>1 and w(i+1)=w(i) + 1 if s(i)=1, and
g(i+1)=g(i) + 1 if s(i)>1 and 1 if s(i) = 1. Also make s(i)= INT ( (96-3*w(i)-4*g(i))/5 )
What this means is that for a fixed w(i) we will increase g(i) until s(i) becomes 1. Then we start on the next value of w(i) and bring s(i) back to 1 again.
The maximum possible value of w(i) is (96-4-5)/3 = 87/3=29 as this will give us g(i)=s(i)=1, so the process needs to be continued till w(i) reaches 29.
In all cases s(i) will represent the maximum value of combinations possible for the corresponding values of w(i) and g(i). Therefore, to determine the total number of possible ways to pack, all we have to do is add all the values of s(i). The result is 2,049 so that is the answer
- ?Lv 45 years ago
properly Terry, i could have emailled this reaction to you, yet you have no longer allowed e mail. What yet another answerer does is unquestionably as much as them. in case you're actually not mushy with their selections, then you definitely can continually opt for to forget approximately them. I have not have been given any situation along with your remark approximately this difficulty aside from your final remark which became into unnessary to place across your message...and probable alienated maximum folk of answerers. After this, probable extra tact could be so as. and you may e mail me in case you prefer. that is in my profile.