The task which was given to me as an Intern at IIT hyderabad is:
To determine the number of sets of permutations in which n distinct objects can be permutated without repeating the position of any object. The number was determined algorithmically using C program and later was found to be related to a number of Latin squares of order N.
Tools and languages used : Turbo C, C programming.