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 did the archetype of the devil usually symbolize in the American romantic literature The greed, cruelty and dishonesty of society The religious beliefs and
Civil society refers to
By the 1690s, most New England colonies became more like the Rhode Island founders regarding their treatment of
Which of the following reasons explains why the Islamic Golden Age was successful?
If f(x) = 2x2 − 10, find f(5). 90 10 7.5 40
What did the Social Security Act and the Work Progress Administration have in common regarding employment for young people? They gave younger workers more right
As a result of the peloponnesian war Sparta was
How many genotypes are possible for the offspring of a homozygous male and heterozygous female.
PLEASE HELP Consider eight, eight-cubic centimeter (8 cm3) sugar cubes stacked so that they form a single 2 x 2 x 2 cube. How does the surface area of the singl
What did the Puritans of Massachusetts hope to create?