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 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

What is party-as-organization?
Simplify (7-8i)+(-12-4i)
One of the heaviest rainfalls recorded in Greentown in a 24 hour period was 178.8 centimeters. If the rainfall was constant how many centimeters of rain fell du
Log4(6x-8)=3 Help please
Cory's average score after 8 tests is 91%. If he gets a 78% on his 9th test what will his new average be? How do i figure out this problem?
what is tn=6n-9.5,t15
write the ratio as a fraction in simplest form. 16ft to 6yd
Log4(6x-8)=3 Help please
How do you put 0.8918 as a fraction
What are the steps to solve this?