Box Problem Redux

a × b × c + d × e × f = g × h × i a \times b \times c + d \times e \times f = g \times h \times i

Find largest 9 consecutive integers that can be arranged such that they satisfy the equation above.

What is the value of g × h × i g \times h \times i ?

That is, sum of the volumes of two boxes equals that of the third box. What is the volume of the third box?

Note : The integers a , b , c , , i a, b, c,\ldots, i are not necessarily in order. Only that 9 consecutive integers are used, each once.


Full credit for this wonderful problem goes to Vikram Pandya.


The answer is 1092.

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.

2 solutions

Bolin Chen
Jan 14, 2016

OK,maybe there's a more rigorous proof here.

Clearly,in 9 consecutive natural numbers,at least 4 of them are even.

According to the principle of drawer,the three box must have a even number in it at least.i.e.the volume of the three boxes all are even.

Let the Median = n

the all 9 integers can be expressed as (n-4),(n-3),(n-2),(n-1),n,(n+1),(n+2),(n+3),(n+4),n≥5

Meanwhile, these nine integers can not have any one of the more than 13 prime factor(n≤9), or according to the prime decomposition theorem, can not meet the conditions set.

1° n is odd.

there 5 odd numbers and 4 even numbers.

Def.○ is odd,● is even.

Case 1 ●○○ +●○○=●●○

Both sides mod 4,we have ●○○+●○○≡0(mod 4)

∴abc≡def≡0(mod 4) or abc≡1(mod 4),def≡3(mod 4) or abc≡def≡2(mod 4)

if x≡y≡0(mod 4),n=4k+1 or 4k+3

when n=4k+1,we heve

(n+1)(n-4)(n-3)+(n+3)(n+2)(n-2)=n(n+4)(n-1)

here n = 5.abc=12,def=168,ghi=180

if abc≡1(mod 4),def≡3(mod 4),No solution

if abc≡def≡2(mod 4)

(n-4)(n+1)n+(n-1)(n+3)(n-2)=(n+4)(n+2)(n-3)

Only n=5 satisfied.abc=30,def=96,ghi=126

Case 2 ●●○+●○○=●○○

Similarly,we have

(n-3)(n+1)(n+2)+(n-1)(n+4)(n-4)=(n+3)n(n-2)

n=5,abc=84,def=36,ghi=120

(n-4)(n-3)(n+1)+(n-1)n(n+2)=(n-2)(n+3)(n+4)

n=9,abc=300,def=792,ghi=1092

Similarly,discussion n is an even number of cases.

Only n=6,then,abc=48,def=152,ghi=300

SO THE LARGEST VALUE IS 1092

Michael Mendrin
Oct 18, 2015

5 × 6 × 10 + 8 × 9 × 11 = 7 × 12 × 13 = 1092 5\times 6\times 10+8\times 9\times 11=7\times 12\times 13=1092

is the maximum.

Do you have the proof?

Pi Han Goh - 5 years, 7 months ago

Log in to reply

I'll put it up in a bit.

Michael Mendrin - 5 years, 7 months ago

Log in to reply

Well, from the glance of it: I think you can start bounding on the largest value to a mere 20 (or 30). Then after that, it's just plenty of case by case. But I'm not sure if that's the approach you're going for.

Pi Han Goh - 5 years, 7 months ago

Log in to reply

@Pi Han Goh Yes, first thing you notice is that there has to be an upper bound to the least of the 9 9 integers, which is about 15 15 . And then there are surprisingly few possible set of integers that meet the conditions.

Michael Mendrin - 5 years, 7 months ago

Log in to reply

@Michael Mendrin Damn. Now you got me interested in finding out the proper solution. I thought this was a mere CS problem blown way out of proportion. Let me put my thinking cap on.

Pi Han Goh - 5 years, 7 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...