Let n be a positive integer, and let x and y be positive real numbers such that xn+yn=1. Prove that (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)<(1−x)(1−y)1.
Solutions — 2
Solution 1
For each real t∈(0,1), 1+t41+t2=t1−t(1+t4)(1−t)(1−t3)<t1 Substituting t=xk and t=yk, 0<k=1∑n1+x4k1+x2k<k=1∑nxk1=xn(1−x)1−xn and 0<k=1∑n1+y4k1+y2k<k=1∑nyk1=yn(1−y)1−yn. Since 1−yn=xn and 1−xn=yn, xn(1−x)1−xn=xn(1−x)yn,yn(1−y)1−yn=yn(1−y)xn and therefore (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)<xn(1−x)yn⋅yn(1−y)xn=(1−x)(1−y)1.
Solution 2
We prove (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)<(1−x)(1−y)(21+2ln2)2<(1−x)(1−y)0.7001(1) The idea is to estimate each term on the left-hand side with the same constant. To find the upper bound for the expression 1+x4k1+x2k, consider the function f(t)=1+t21+t in interval (0,1). Since f′(t)=(1+t2)21−2t−t2=(1+t2)2(2+1+t)(2−1−t) the function increases in interval (0,2−1] and decreases in [2−1,1). Therefore the maximum is at point t0=2−1 and f(t)=1+t21+t≤f(t0)=21+2=α Applying this to each term on the left-hand side of (1), we obtain (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)≤nα⋅nα=(nα)2.(2) To estimate (1−x)(1−y) on the right-hand side, consider the function g(t)=ln(1−t1/n)+ln(1−(1−t)1/n) Substituting s for 1−t, we have −ng′(t)=1−t1/nt1/n−1−1−s1/ns1/n−1=st1(1−t1/n(1−t)t1/n−1−s1/n(1−s)s1/n)=sth(t)−h(s). The function h(t)=t1/n1−t1/n1−t=i=1∑nti/n is obviously increasing for t∈(0,1), hence for these values of t we have g′(t)>0⟺h(t)<h(s)⟺t<s=1−t⟺t<21. Then, the maximum of g(t) in ( 0,1 ) is attained at point t1=1/2 and therefore g(t)≤g(21)=2ln(1−2−1/n),t∈(0,1) Substituting t=xn, we have 1−t=yn,(1−x)(1−y)=expg(t) and hence (1−x)(1−y)=expg(t)≤(1−2−1/n)2(3) Combining (2) and (3), we get (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)≤(αn)2⋅1≤(αn)2(1−x)(1−y)(1−2−1/n)2=(1−x)(1−y)(αn(1−2−1/n))2. Applying the inequality 1−exp(−t)<t for t=nln2, we obtain αn(1−2−1/n)=αn(1−exp(−nln2))<αn⋅nln2=αln2=21+2ln2. Hence, (k=1∑n1+x4k1+x2k)(k=1∑n1+y4k1+y2k)<(1−x)(1−y)(21+2ln2)2
Looking for a route rather than an archive? The track puts 2,000
problems in a working order, from AMC 10 level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement and solution reproduced as published; topic and difficulty added by this site.