Vinod has 5 registers and 6 cover papers of different colours. In how many ways can he cover all the registers with cover papers?

This problem can be solved using the concept of permutations in combinatorics.

Step 1: Understand the problem Vinod has 5 registers and 6 cover papers of different colours. He wants to cover each register with a different colour.

Step 2: Identify the number of permutations The number of ways to cover the 5 registers with 6 different coloured cover papers is given by the number of permutations of 6 items taken 5 at a time.

Step 3: Calculate the number of permutations The formula for permutations is P(n, r) = n! / (n-r)!, where n is the total number of items, r is the number of items to choose, and '!' denotes factorial.

So, P(6, 5) = 6! / (6-5)! = 65432*1 / 1 = 720 ways.

So, Vinod can cover his 5 registers with the 6 different coloured cover papers in 720 different ways.