document.write( "Question 984076: Find a formula of the number of permutations of the set {1,2,3,,,,n} where none of the numbers are in their natural position if you could help me again please \n" ); document.write( "
Algebra.Com's Answer #604884 by Edwin McCravy(20055)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "The formula for the number of \"derangements\", or the ways a given \r\n" );
document.write( "n-permutation can be rearranged so that every element moves to a new \r\n" );
document.write( "position is called n-subfactorial, and is denoted by !n, the \r\n" );
document.write( "exclamation mark is before the number instead of after it like \r\n" );
document.write( "a regular factorial.\r\n" );
document.write( "\r\n" );
document.write( "The formula is\r\n" );
document.write( "\r\n" );
document.write( "\"%22%21n%22\"\"%22%22=%22%22\"\"matrix%281%2C6%2Cthe%2C+greatest%2Cinteger%2Cnot%2Cexceeding%2Cn%21%2Fe%29\",\r\n" );
document.write( "where  e = 2.718281828459045235360287471352662497757247093699959574966967...\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );