Pigeon hole principle solution explanation Having trouble understanding a solution to a textbook problem.   
A computer randomly prints three-digit codes, with no repeated digits in any code. What is the minimum number of codes that must be printed in order to guarantee that at least six of the codes are identical?  
I have the solution,  
$^{10} P_{3} = (10)(9)(8) = 720$ distinct values
The minimum number of codes is $5\times ^{10} P_{3} + 1 = 3601$  
I don't understand why $n$ is being multiplied by $5$ and added with $1$.
To my understanding, having $726$ codes would ensure that $6$ of them are repeated. So why does the value need to be multiplied and added to?

The idea is that you want to guarantee to have one code printed six times. 
So, for example, with $3600$ print outs you could potentially have every code printed exactly five times. This is why you need to have at least $3601$ to guarantee one code being printed six times.
