Ask Question
15 June, 12:02

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

+3
Answers (1)
  1. 15 June, 13:41
    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 you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers