Spelling "MATH"!

Logic Level 4

In the array above, two letters are called neighbouring letters if they are adjacent to each other horizontally, vertically or diagonally. Starting from any letter " M M " on the outside of the array, find the number of ways of spelling " M A T H MATH " by moving only between neighbouring letters.


The answer is 104.

Satyajit Mohanty by Satyajit Mohanty , 24, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

2 solutions

Jeremy Karis
Sep 11, 2015

for the first part(most light blue one) there is only one way to get there so insert one, for the second part(the one that bluer) you can fill it with the sum of how many "M' that is neighbouring with that 'A', and for every next part just use the same method

6 Helpful 0 Interesting 0 Brilliant 0 Confused

Similar solution for me, but I start from the middle and at last sum the M's

展豪 張 - 5 years, 5 months ago
Arpit MIshra
Sep 14, 2015

Since the Image is Radially Symmetrical we can see there only are 4 type of M's.

M Type 1 - 1 way to reach MATH.

M Type 2 - 3 ways to reach MATH.

M Type 3 - 6 ways to reach MATH.

M Type 4 - 7 ways to reach MATH.

Therefore after Adding the 4 types of M Type 4 (4 7) and the 8 types of M type 3 (8 6) and the 8 types of M Type 2 (3 8) and 4 types of of M type 1 (1 4) we get:

28+48+24+4

= 104.

Note: I'm Out of Time So I'll Latex it Later.

5 Helpful 0 Interesting 0 Brilliant 0 Confused

Or you can start from H and see that there are 2 kinds of T. That will simplify calculation.

A A - 5 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...