You are not logged in.
Pages: 1
prove that ,
u (to the power)n × v(to the power)(1-n) ≤nu + (1-n)v
n∈(o,1) and u,v > 0
by the way how do I bring this superscripts ? As word files are not working.
Offline
To do superscripts:
u[sup]n[/sup]
and you get:
u[sup]n[/sup]
"The physicists defer only to mathematicians, and the mathematicians defer only to God ..." - Leon M. Lederman
Offline
Hence, the question would be.....
Prove that u[sup]n[/sup] x v[sup]1-n[/sup]≤nu+(1-n)v
where
n∈(o,1) and u,v > 0
It appears to me that if one wants to make progress in mathematics, one should study the masters and not the pupils. - Niels Henrik Abel.
Nothing is better than reading and gaining more and more knowledge - Stephen William Hawking.
Offline
If n = 0, then the inequality simplifies down to v ≤ v.
Similarly, if n = 1, then the inequality simplifies down to u ≤ u.
So u[sup]n[/sup] x v[sup]1-n[/sup] ≤ nu+(1-n)v all the time because they are actually always equal to each other.
Why did the vector cross the road?
It wanted to be normal.
Offline
No mathsy thats not quite a proof...but I can give you hints if you want...this is simple...indeed
Offline
I guess I can give you some hints about the solution...you can consider the fact that log is a concave function.
Offline
We must prove that
log(nu+(1-n)v)>=nlog(u)+(1-n)log(v)
Is there some unequation for
log(a+b) and log(a)+log(b)?
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Rimiq please, help us more.
IPBLE: Increasing Performance By Lowering Expectations.
Offline
Pages: 1