You are organizing a dinner with n di erent groups of friends, with each group composed of gi members with i 2 f1; : : : ; ng. you have m tables each for r people, and you want want to impose that all friends from the same group should be seated in di erent tables. in this way you will obligate your friends ( nally) to chat with people who does not belong to their closest groups. show (graphically) that using a maximum ow formulation we can nd a feasible arrangement of friends to tables that satisfy the rule mentioned above, or show that it is not possible. hint: imagine that someone solves the maximum flow problem (that you need to find)
and tells you what's the maximum flow. using that number, how can you know if it
was possible to nd the arrangement suggested in the problem statement or not.
after 8 months, she pays $169 after 10 months, she pays $205
1. multiply $18 by 8
2. add 25
3. multiply 10 by 18
4. add 25
answer: your answer is c, hope this !
you paint 1/2 the wall in 1/4 of the hour or 15 min. but you need to paint the whole wall so 15*2=30 so you can finish painting 30 min or 2/4 or .5 of the hour
we know that they paid 1.32 million and was 19% above what they paid in 2007.
since they paid 19 percent above (1.19) 2007 we can reverse and do 0.81 * 1,320,000 to get our answer.
you may be wondering why it's 0.81 instead of 0.19 that is because 1.19 is over 1. since 100 is equal to a whole we subtract 0.19 from 100 to get our value we multiply by.
1,320,000 * 0.81 = 1,069,200
we can also find the different simply by doing 1,320,000 * 0.19 which equals 250,800 and to get our answer from here we just subtract 1,320,00 by 250,800