If the best and the worst paper never appear together, then six examination papers can be arranged in how many ways
To solve this problem, we can use the concept of permutation.
First, let's consider arranging the 6 examination papers with no restrictions. This can be done in 6! = 6 x 5 x 4 x 3 x 2 x 1 = 720 ways.
Next, let's consider the case where the best and worst papers appear together. Since the best and worst papers are treated as one unit, there are 5 units to arrange (Best/Worst unit, 4 remaining papers). The number of ways to arrange these 5 units is 5!.
Therefore, the number of ways to arrange the 6 examination papers with the best and worst papers together is 5! = 5 x 4 x 3 x 2 x 1 = 120 ways.
Finally, to find the number of ways to arrange the 6 examination papers such that the best and worst papers never appear together, we subtract the number of ways with the best and worst papers together from the total number of ways:
Total number of ways - Number of ways with best and worst papers together = 720 - 120 = 600 ways.
Therefore, there are 600 ways to arrange the 6 examination papers such that the best and worst papers never appear together.