Equality holds at these inequalities when a=c and b=d. Thus (a+c)(b+d)=ac+bd can be rewritten as 4ab=a2+b2. Solving for a gives a=b(2±3) and thus a possible solution S=8 for b=d=1 and a=c=2+3.
Solution 2
Solution:
The shift (a,b,c,d)→(b,c,d,a) changes neither the value of S nor the constraint. Therefore we may assume WLOG that ac≥bd and set t=bdac with t≥1.
From the condition it follows that t2+1=bdac+bd=(a+c)(d1+b1)≥2ac⋅2bd1=4t, where in the second-to-last step the AM-GM inequality was used. Thus t2−4t+1≥0 holds and therefore (t≥2+3∨t≤2−3), which, because of t≥1, leads to t≥2+3.
We have S=(ba+dc)+(cb+ad)≥2bdac+2acbd=2(t+t1). By differentiating we see that for all t≥2+3 we have: S′(t)=2−2/t2≥0. Therefore S has a minimum at t=2+3 and it follows that S≥2(t+t1)≥2(2+3+2+31)=2(2+3+2−3)=8.
For (a,b,c,d)=(1,2+3,1,2+3) both (a+c)(b+d)=8+43=1⋅1+(2+3)(2+3)=ac+bd and S=2+31+12+3+2+31+12+3=2−3+2+3+2−3+2+3=8 hold.
Therefore 8 is the smallest value of S. □
Want a route through all this instead of 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 translated into English from de; metadata (topic, difficulty) added by this project.