Nathan is stocking bathrooms at the hotel where he works. he has 18 rolls of toilet paper and 9 bars of soap. if he wants all bathrooms to be stocked identically, with the same combination of supplies in each one and nothing left over, what is the greatest combination of bathrooms Nathan can stock

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."

my computer is slow i can not see it sorry

given the equation is 8+9z=-6, the first step would be to subtract the 8 from both sides:

8+9z-8=-6-8

since 8 minus 8 = 0, this would cancel out the 8. and since -6 minus 8 equals -14, the equation would look like this

9z = -14

the correct answer is c) 2.