Three-Two-One Gooo

If a b c = 6561 a^{b^c}=6561 , then find the smallest possible value of ( a × b × c ) (a \times b \times c) such that a , b , c a,b,c are all integers.

None of these choices 0 18 24

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.

3 solutions

Abhishek Sharma
May 12, 2015

No finite least possible value exists.

Example - a = 6561 a=6561 , b = 1 b=1 and c = 100000000 c=-100000000 ( a very small negative number that is large in terms of magnitude).

Moderator note:

Right. We can abuse the fact that 1 x = 1 1^x = 1 for all x x . Bonus question: what would the answer be if we add the constraint b ± 1 b\ne\pm1 ?

@Sandeep Bhardwaj Arghh.... you got me! Tricky question; I had automatically, but mistakingly, assumed that we were dealing only with positive integers. (Sorry for the earlier fuss with my report.) Nice catch, Abhishek. :)

Brian Charlesworth - 6 years, 1 month ago

Log in to reply

Same with me. A very nice question at all.

Shyambhu Mukherjee - 5 years, 5 months ago

Re Bonus question: I'm thinking ( 3 8 8 n ) 8 n , \large (3^{8*8^{n}})^{8^{-n}}, making a b c = 8 n 3 8 n + 1 \large abc = -8n*3^{8^{n+1}} for any positive integer n n , and thus there is no least possible value as we can make it arbitrarily large (and negative).

Brian Charlesworth - 6 years, 1 month ago

Log in to reply

Where did the negative sign come from?

8^-n is positive.

Aadil Bhore - 6 years, 1 month ago

Log in to reply

a = 3 8 × 8 n , b = 8 , c = n a = 3 ^ { 8 \times 8 ^ n } , b = 8, c = -n .

Remember that tower of exponents are evaluated top down, and not bottom up, IE a ( b c ) a ^ { \left( b ^ c \right) } instead of ( a b ) c \left ( a ^ b \right) ^ c .

Calvin Lin Staff - 6 years, 1 month ago

Log in to reply

@Calvin Lin Is the minimum 0 in that case? 656 1 5 0 6561^{5^0}

Pranjal Jain - 6 years ago

Log in to reply

@Pranjal Jain As Brian pointed out, a b c = 8 n 3 8 n + 1 abc = -8n 3^{8^{n+1}} . Let n n \rightarrow \infty and a b c abc \rightarrow - \infty , so there is no infimum / minimum.

Calvin Lin Staff - 6 years ago

Log in to reply

@Calvin Lin How unfortunate that the question says "smallest" instead of "least" or "lowest".

Erick Wong - 5 years, 4 months ago

Log in to reply

@Erick Wong How is that unfortunate? What is the difference between "smallest" and "least" and "lowest"?

Calvin Lin Staff - 5 years, 4 months ago

Log in to reply

@Calvin Lin "Lowest" unequivocally means "closest to -infinity", whereas "smallest" can very reasonably be used to mean "closest to 0" (e.g. sin x is close to x for small x). What makes it unfortunate is that the question is ambiguous when phrased using "smallest", when it could very easily have been written with clearer intent.

Erick Wong - 5 years, 2 months ago

Level 5 :O

Arulx Z - 6 years ago

a = -81, b = 2, c = 1 gives -162 with b^2 not 1.

Andrew Machkasov - 6 years ago

for the values a=6561 b=1 and c=-1000000...... this wouldn't be equal to 6561 when [(a^{b})^{c}] is calculated although the product will be quite small

Satyam Pandey - 6 years ago

this is not 6561. a^b^c = a^bc. In your case it would be 6561^(-100000000), that would be a very small number.

ras dwivedi - 6 years ago

Randomly press the calculator and found out that 3^(2^3) = 6561 where a = 3, b = 2 and c = 3. I got the answer wrong because I didn't realize that integers can be negative in this case.

AccelNano Lim Loong - 6 years ago

If b <> +/- 1 then (-81)^2^1 = -162 shall be the one.

Lu Chee Ket - 5 years, 8 months ago
Lu Chee Ket
Oct 16, 2015

6561^(-1)^(Positive even) was what I thought most negative.

6561^1^(Negative) is also another extreme provided we are not talking about magnitude such as zero.

Lu Chee Ket - 5 years, 8 months ago

This has already been solved before where I did not get correct solution.

Oh, I don't remember seeing it before. At least you didn't get "caught" this time around like I did. :)

Brian Charlesworth - 6 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...