Ask Question
24 November, 14:19

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

+2
Answers (1)
  1. 24 November, 16:51
    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?
Get 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 there is no answer or all answers are wrong, use a search bar and try to find the answer among similar questions.
Search for Other Answers