Question

How many ways are there to arrange 1,2,3,4,5 in a line, such that n is not in the nth position?

For Example: 2,1,3,4,5 is not valid because 3 is the 3rd in the line but 2,1,4,5,3 is valid because none of the numbers are in their original position.

Answer 1

256 ways

Explanation:

Okay so n cannot be in the nth place, but there are 5 places available.

So thinking about it technically you can have 4 of each number in a different spot not their own, and 4x4x4x4 = 256

However, if that doesn't work, you could try 4! which is 4x3x2x1 = 24

Hope that helps :)