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

Joaquin has d more than three times the number of baseball cards as Sam. Sam has f baseball cards.​
is used for finding out about objects, properties and methods​
From lines 26-31, give two ways the writer, Che Guevara, describes his feelings. You may use your own words or quotations from the text.
plz help I give 50 points
A tank of water is 4m deep. How deep does it appear when seen normally?​
find the product. write your answer in exponential form. 1^-7*1^3​
I need help please !!!!!!!!
At the beginning of the school year, Jamie had $500 in her savings account. She wants to have at least $200 left in the account at the end of the school year. E
My next photo How's it​
ASAP EASY PLZ WILL give you the crown if right ....... helppppppppppppppppppppp me its multiple choice question only one answer