a b c = a b + b a + a c + c a + b c + c b
If a b c satify the above of equation and a , b , c = 0 . Find the possible maximum value of a b c .
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.
Bounding the value of a restricts the solution set. Why do we have a ≤ 3 ?
Reply to moderator. There is a pattern. If a=x, b=3x
Let the maximum value be x . In order to maximize x , we must start by figuring the maximum value of a , since that will be the digit which amplifies x the most.
1 0 0 a + 1 0 b + c = 2 2 a + 2 2 b + 2 2 c
Trying random values of a from 1, it is clear that a cannot cross 3. We set a = 3 . This means 2 3 4 = 1 2 b + 2 1 c . Next, we move to maximizing b . We start with b = 9 and we find, such a c exists. Hence, by digit jumping, we figure a b c = 3 9 6 .
Problem Loading...
Note Loading...
Set Loading...
a b c ⇒ 1 0 0 a + 1 0 b + c 7 8 a 2 6 a 2 6 a − 7 c = a b + b a + a c + c a + b c + c b = 2 2 ( a + b + c ) ⇒ c = 0 is even ⇒ c = 2 , 4 , 6 , 8 = 1 2 b + 2 1 c = 4 b + 7 c = 4 b
The only acceptable positive values of b are when: ⎩ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎧ a = 1 and c = 2 a = 2 and c = 4 a = 3 and c = 6 ⇒ b = 4 2 6 − 1 4 = 3 ⇒ b = 4 5 2 − 2 8 = 6 ⇒ b = 4 7 8 − 4 2 = 9
For a > 3 , b > 9 , which is not acceptable. Therefore, the maximum value of a b c = 3 9 6