Monster problem
Posted: Sat Feb 08, 2014 12:26 pm
A four headed monster has 63 children . He wants to give each child a name of three English letters . And every 63 names will be different . In a name of a child , a letter can be used more than once . What is the minimum number of letters does the monster need to use ?