Let the positive difference between 1 2 + 2 2 + 3 2 + 4 2 + . . . + 2 0 1 4 2 and 1 3 + 2 3 + 3 3 + 4 3 + . . . + 2 0 1 4 3 be equal to N . Compute the digit sum of N .
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.
Can somebody help me find solutions to this question?
Anagram Cracker!!
Anagrams are problems related to shuffled letters which are needed to be arranged and made into perfect meaningful sentences without repeating the letters (letters can be used only once).
Here are some anagrams which you need to crack:
1) tuteauaewribeifslh
2) geaperioitrdspawsagnhabineod
3) enaednenetorfyimrw
Remember to arrange and make a meaningful sentence (one sentence from each group of letters), not single word. If you are able to solve this anagrams please inform me the answers as well as how you found the solutions to the anagrams.
Details and assumptions:
Example:
"My name is Anil" can be written in the form of group of letters as:
meailaysmnni
I had to calculate the whole number to find the digit sum.... Please tell me to do it in a better way without finding the whole number...ThAnKs
Problem Loading...
Note Loading...
Set Loading...
The value of N :
N = ( 1 3 + 2 3 + 3 3 + 4 3 + . . . + 2 0 1 4 3 ) − ( 1 2 + 2 2 + 3 2 + 4 2 + . . . + 2 0 1 4 2 ) = 4 , 1 1 4 , 5 4 2 , 0 1 3 , 0 1 0
Digit sum of N = 4 + 1 + 1 + 4 + 5 + 4 + 2 + 0 + 1 + 3 + 0 + 1 + 0 = 2 6