How many ways are there to distribute n graded homeworks to n students such that none of them gets their own homework back?
1 answer:
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)
You might be interested in
Answer:
400 ways
Step-by-step explanation:
Times 10 x 10 x 2 x 2 to get your answer
Answer: i dont know
Step-by-step explanation:ok i am srry
250 + 100 = 350
350 + 1000 = 1350
1350 / 5 = 270
they need to sell 270 tickets
answer is B
Answer:
d
Step-by-step explanation:
Answer:
first one
Step-by-step explanation: