Monster problem
- Raiyan Jamil
- Posts:138
- Joined:Fri Mar 29, 2013 3:49 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 ?
A smile is the best way to get through a tough situation, even if it's a fake smile.
- Thanic Nur Samin
- Posts:176
- Joined:Sun Dec 01, 2013 11:02 am
Re: Monster problem
The answer is 4 letters
Hammer with tact.
Because destroying everything mindlessly isn't cool enough.
Because destroying everything mindlessly isn't cool enough.
Re: Monster problem
@Thanic nur Samin, Please practise posting full solutions or at least hints for your solution unless asked explicitly for just the answer to the problem. Because most often, people asking for help are actually asking for ideas/keys to solve the problem and not just the answer.
Here's a possible way to solve this problem.
Here's a possible way to solve this problem.
Please Install $L^AT_EX$ fonts in your PC for better looking equations,
Learn how to write equations, and don't forget to read Forum Guide and Rules.
"When you have eliminated the impossible, whatever remains, however improbable, must be the truth." - Sherlock Holmes
Learn how to write equations, and don't forget to read Forum Guide and Rules.
"When you have eliminated the impossible, whatever remains, however improbable, must be the truth." - Sherlock Holmes