Ask Question
25 May, 17:20

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

+4
Answers (1)
  1. 25 May, 17:31
    0
    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)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “How many ways are there to distribute n graded homeworks to n students such that none of them gets their own homework back? ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers