a b c a 3 b c + a b 2 c + a b c 2 + 1
Let a , b and c be positive reals, if the minimum value of the expression above is k , find ⌈ k ⌉ .
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.
Wow I did it the same way never thought about it at the first time.
I did same and nice problem
this will be tougher than the usual algebra approach,
i used calculus because i suck at AM-GM inequalities
start with simplifying the function
F = a 2 + b + c + a b c 1
taking the gradient
∇ F = ⎝ ⎛ 2 a − a 2 b c 1 1 − a b 2 c 1 1 − a b c 2 1 ⎠ ⎞
our goal is to find a,b,c such that
∇ F = 0
lets start by looking at the second and third row
1 = a b c 2 1 = a b 2 c 1 a b c 2 = a b 2 c c = b ⟹ a c 3 1 = 1
from the third row we know that,
a = 3 2 c 2 1
substituting we get
c 3 = 3 2 c 2
solving for c we get
c = 7 2 i used a calculator at the end,you can definitely do it by hand but i used it to save time
you will get
≈ 3 . 8 6 4
so the answer is 4
You should review your solution. The minimum value is at 7 2 6 7 ≈ 3 . 8 6 4 3 1 .
Log in to reply
Log in to reply
The error occurred when you wrote c 3 3 2 c 2 = 1
You meant to write c 3 = 3 2 c 2 getting the correct value c = 2 7 1 .
Log in to reply
@Isaac Buckley – thanks for finding it!
@Isaac Buckley – @Isaac Buckley
can you check my solution for this problem https://brilliant.org/problems/whos-up-to-the-challenge3/?group=tTJG88CUZHbN ?
Thanks
F = a 2 + b + c + a b c 1 . I f a = b = c = 1 . , F = 4 . Let us try to reduce say c by posetive δ . S o F = 1 2 + 1 + 1 − δ + 1 ∗ 1 ∗ ( 1 − δ ) 1 . ∴ F = 3 + 1 ∗ 1 ∗ ( 1 − δ ) 1 − δ = 3 + 1 − δ 1 − δ + δ = 3 + 1 + 1 − δ δ − δ ∴ F = 4 + 1 − δ δ − δ > 4 . N o t e : 1 − δ δ > δ , Let us try to reduce F by increasing c by posetive δ , s o a b c 1 i s r e d u c e d . S o F = 1 2 + 1 + 1 + δ + 1 ∗ 1 ∗ ( 1 + δ ) 1 = 3 + 1 + δ 1 + δ − δ + δ . ∴ F = 4 − 1 + δ δ + δ > 4 . N o t e : δ > 1 + δ δ . So any of a, b, c is increased or decreased, F>4. So F=4 is the minimum.
Which method is this?
Log in to reply
This is the basic method to show minimum or maximum.
substituting a=1,b=1,c=1. answer is 4
dude that's because i let the answer be ⌈ k ⌉
With my own principle, let all the variables be equal to one for the minimum..
Equating all variables to often give extreme values, but under what condition ? It is not always. Can some one help?
Log in to reply
it only works for symmetrical inequality. This one's not cause the equality holds when b = c = 2 a 3 1 so assuming all variables are equal is wrong
Problem Loading...
Note Loading...
Set Loading...
F can be written as F = a 2 + b + c + a b c 1 = a 2 + 2 b + 2 b + 2 c + 2 c + 2 a b c 1 + 2 a b c 1 Using AM-GM inequality we get F ≥ 7 7 2 6 ( a b c ) 2 ( a b c ) 2 = 7 2 6 7 = k ⇒ ⌈ k ⌉ = 4 * The equality holds when b = c = 2 a 3 1