In the alphabet, suppose we assign a value to all the alphabets such that A+B=C
B+C=D
C+D=E
and so on
And let A=D=333
find the value of M
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.
In the alphabet, suppose we assign a value to all the alphabets such that A+B=C B+C=D
C+D=E
and so on
now let A=D=1
1+B=C
B+C=1
so B=1-C
putting this in 1st eq., we get
1+1-C=C
2=2C
C=1
now A+B=C
1+B=1
B=0
so the series will become a fibonacci series from C to Z
Now to convert this into the desired series, we multiply each term by 333 hence when earlier M's value would be 89, now it would be 89 X 333 = 29637