Min ( Max ) \text{Min} \left ( \text{Max} \right )

Logic Level 2

The numbers from 1 to 9 (both inclusive) are divided into three groups with 3 numbers in each group . The numbers in each group are multiplied. The maximum of these numbers is chosen. Find the minimum value, this maximum can take.


The answer is 72.

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.

4 solutions

Daniel Liu
Jul 9, 2014

Ideally, all three products will equal 9 ! 3 71.32 \sqrt[3]{9!}\approx 71.32 . However, since they are all integers, at least one product will be 72 \ge 72 .

This also means that the lower bound for the minimum of all maximums is 72 72 .

But achieving 72 72 is possible: we take the groups ( 1 , 8 , 9 ) , ( 3 , 4 , 6 ) , ( 2 , 5 , 7 ) (1,8,9),(3,4,6),(2,5,7) . (This gives a product of ( 70 , 72 , 72 ) (70,72,72) .)

Since 72 72 is necessary and achievable, then it must be the answer.

What would be the answer if the maximum of the minimum products is asked?

A Former Brilliant Member - 2 years, 5 months ago

Thanks for the solution.

mietantei conan - 6 years, 11 months ago

It is not clearly stated that groupings must have equal products... When i divide into groups i can just put 3 numbers per group... I think u shud state it or my understanding might be wrong too...

Lambert Quesada - 6 years, 11 months ago

Log in to reply

It goes like this; if a,b,c are the 3 products obtained and applying AM-GM inequality on a,b and c we will arrive on Daniel's solution.

mietantei conan - 6 years, 11 months ago
Chew-Seong Cheong
Jul 11, 2014

My approach is same. To get the minimum of the maximum of the three products P 1 P_{1} , P 2 P_{2} and P 3 P_{3} , our task is to even out the three products. That is to make P 1 P 2 P 3 P_{1} \approx P_{2} \approx P_{3} . My first approach was to match the smallest number 1 1 with the largest number 9 9 , second smallest 2 2 with the second largest 8 8 and 3 3 with 7 7 , and then choose the remaining number for each group to get the minimum maximum. I got the following:

3 × 4 × 7 = 84 3 \times 4 \times 7 = 84 2 × 5 × 8 = 80 2 \times 5 \times 8 = 80 1 × 6 × 9 = 54 1 \times 6 \times 9 = 54

The answer was 84, which is wrong, and I have two more tries.

During a walk in the park, I realized that P 1 P 2 P 3 9 ! 3 71.33 P_{1} \approx P_{2} \approx P_{3} \approx \sqrt [ 3 ]{ 9! } \approx 71.33 . Now still using the previous idea of matching the smallest 1 1 with the largest 9 9 , the remaining number should be 8 8 to make the product 1 × 8 × 9 = 72 71.33 1 \times 8 \times 9 = 72 \approx 71.33 . Move on the next largest number 7 7 , the only possible combination to have the product < 72 < 72 is 2 × 5 × 7 = 70 2 \times 5 \times 7 = 70 . The remaining three numbers give 3 × 4 × 6 = 72 3 \times 4 \times 6 = 72 . So the answer is 72 \boxed{72} .

If the products were to be distinct the best answer would have been 1×9×7, 3×4×6, 2×5×8, which gives the answer 80, which was my 1st try.

Kushagra Sahni - 5 years ago
Nam Diện Lĩnh
Jul 8, 2015

brute force using python:

1
2
3
4
5
6
l=[]
for p in permute([1,2,3,4,5,6,7,8,9]):
    a,b,c,d,e,f,g,h,k=p
    l.append(max(a*b*c, d*e*f, g*h*k))

print min(l)

with permute is the function I wrote in my note

Avijit Sarker
Jul 17, 2014

I actually don't understand how to solve these problems... most of the cases my approaches resemble a brute force approach. I started with three triples (1,9,5), (3,4,7), (2,6,8) , the maximum being 96. I "inspected" that interchanging 5 and 8 will result in a maximum of 84. After that, I interchanged 5 and 7, obtained the final result. It is more of a "local search" than logic.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...