Monday, February 18, 2008

sQuieeez -1 13th Feb 08

Answers to the sQuieeez 1 problems are :

Answer 1:

3468

Starting at any of the N's, there are 17 different readings of NAK, or 68 (4 times 17) for the 4 N's. Therefore there are also 68 ways of spelling KAN. If we were allowed to use the same N twice in a spelling, the answer would be 68 times 68, or 4,624 ways. But the conditions were, "always passing from one letter to another." Therefore, for every one of the 17 ways of spelling KAN with a particular N, there would be 51 ways (3 times 17) of completing the NAK, or 867 (17 times 51) ways for the complete word. Hence, as there are four N's to use in KAN, the correct solution of the puzzle is 3,468 (4 times 867) different ways.

Answer 2:

Note that if and only if n = m2 + m for some m. Thus n + and n - each increased by 1 except at n =m2 + m, where the former skips from n = m2 + 2m to n = m2 + 2m + 2 and the latter repeats the value m2. Thus the sums are

= 2 + 1 = 3.

3 comments:

Anonymous said...

Well Brother
I want to show a case
When you are taking the solution this way there is a possibility that the starting and the ending k are the same or even you can overlap the give A's also
This shows the letters are not distinct and are getting repeated
e.g. start from K13 A23 N33 N34 A23 K13
this is valid according to your solution but invalid as per the conditions given.

Right?

Now this was a doubt in my mind right from the first day i asked in query but they said all letters are distinct that is K once used can't be reused.
This made the problem tough and answer was 3244

Ankur said...

Please post the questions along with the answers.

Anonymous said...

cordinators..............
@ shashank...it was passing from one word to another word.you cannot repeat the word consecutively but can repeat afterward.i dont know but if u got the wrong interpretation or we didnt understand ur query. please, leave it and try for next week.
BEST OF LUCK