Seven people are in an elevator which stops at ten
floors. In how many ways
can they get o the elevator...

- vishal_kothari

- jamiebookeater

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this

and **thousands** of other questions

- vishal_kothari

get*off*the

- nubeer

not sure maybe 10! x 7!

- vishal_kothari

no..

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

- anonymous

\( 11^7 \) ?

- vishal_kothari

no..

- anonymous

what is the answer ?

- anonymous

@across: I don't think that's the right answer.

- vishal_kothari

(a) 7^10
(b) 10^7

- vishal_kothari

answer lies between this two...

- anonymous

answer is \( 10^7 \) then.

- anonymous

Oh, I think the answer that across gave assumed that each one gets off in a different floor?

- vishal_kothari

how?

- anonymous

The problem is modeled as " how many ways can n distinct object can be divided in r distinct groups " some groups may be empty.

- anonymous

My earlier answer assumes the super-set and I over counted few other cases.

- across

FFM is correct.

- vishal_kothari

ya..

- across

Think of it in smaller terms: suppose there are three floors and two people; they can get off the elevator in 9 different ways, which is \(3^2\) as FFM's model states.\[\]

- anonymous

Precisely, my earlier answer assumes that the seven people need not to get off the elevator at all and only some of them get down and all of the other obvious cases.

- anonymous

@across: wanna try a variation " atleast one should get off in each floor" ? ; )

- vishal_kothari

ok..

- across

In this case, though, there are more floors than there are people. :p

- anonymous

@vishal kothari: It's a bit hard, don't attempt it if you don't need it.

- anonymous

@across: well just increase the numbers :P

- across

Let's try 7 floors and 10 people.

- anonymous

or more generally any \( r \gt n \)

- anonymous

Sorry it should be:
or more generally any \( r

- across

Whoops.

- anonymous

@across: Sorry, that doesn't seem correct, as \( n^{ \underline{r} } \) is not the correct assumption, generally people attempt it with mutual inclusion-exclusion, but there is a even clever way, If you want I can give you a hint but it would be probably a spoiler.

- pokemon23

anyone willing to explain me about square roots?

- anonymous

Anyways, always excuse my solecism :P

- anonymous

Assume that the elevator riders are considered indistinguishable, for example, 7 warm bodies. There are 11440 ways for them to get off of an elevator servicing 10 floors.
http://2000clicks.com/mathhelp/CountingObjectsInBoxes.aspx
Refer to:
Indistinguishable Objects to Distinguishable Boxes
The number of different ways to distribute n indistinguishable balls into k distinguishable boxes is C(n+k-1,k-1).
For those who have access to Mathematica the following is a user defined function called Elevator where r is the number of riders and f is the number of floors.
Elevator[ r_ , f_ ] := Binomial[ r + f - 1, f - 1]

Looking for something else?

Not the answer you are looking for? Search for more explanations.