In this question, each letter represents a different digit from 1 to 9, the same letter representing the same digit each time it appears.
What is the maximum possible value that could equal?
Note: In this problem, the value of refers to
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.
Let B R I L L I A N T = x
Therefore, L I M E + B R I L L I A N T = x + 2 1
Or rearranging, ( L I M E B R A N T ) + I L L I = x + 2 1
Since, the sum of integers from 1 to 9 is equal to 45, and L I M E B R A N T includes 1 of each letter,
4 5 + I L L I = x + 2 1
2 4 + I L L I = x
As we have let x be the value of B R I L L I A N T , we want to maximise x to answer the question. This in turn means maximising the values of I and L . The two largest (distinct) digits that can be used are 8 and 9. This makes x = 5 8
Now that we have found the maximum case, all we need to do is show that it is possible and it can be done using any one of the combinations below:
Therefore the maximum possible value of B R I L L I A N T = 5 8