kayleee2162 kayleee2162

03-08-2017
Mathematics

contestada

How many ways are there to distribute n graded homeworks to n students such that none of them gets their own homework back?

Respuesta :

mperemsky mperemsky

03-08-2017

Assume N students

Student 1 can get (n-1) papers
Student 2 can get (n-1) papers
Student 3 can get (n-1) papers
etc
Student N can get (n-1) papers

So for N students you can have N(n-1)

Answer Link

Otras preguntas

need help fast what are all the solution to this problem

This watery vacation spot is considered part of both California and Nevada. Name this lake

Write an equation in point-slope form for the line through the given point with the given slope. (9,-1); m=4/3. I need help!

power set of {e,f,m,n,o}

This song was popular with American troops during the Revolutionary War. Here is a part of its famous refrain: “Stuck a feather in his cap, and called it macar

The last new star was added to the American flag in which year?

According to marginal analysis, you should spend more time studying economics if the extra benefit from an additional hour of study: a. is positive. b. outweigh

United States inventor (born in Scotland) of the telephone (1847-1922)

Who was the oldest signatory of the Declaration of Independence?

The winter-ravaged troops at Valley Forge, suffering from cold, hunger, and disease, participated in many forms of entertainment to keep up morale. What was a