Find the smallest real number c>0 such that {x}+{y}<c+xy for all real numbers x,y>0 and xy<1.
Solution
First, choose x=n+2n+1, y=n+1n with n∈Z+ then xy=n+2n<1. Substituting into the given inequality, we have {n+2n+1+n+1n<c+n+2n⟺c>n+1n+n+21. Here, for n→+∞ we have c≥1. Next, we will prove the inequality with c=1: {x}+{y}<1+xy for all x,y>0 and xy<1. Indeed, we have (1−{x})(1−{y})>0⟹{x}+{y}<1+{x}{y}≤1+xy. This inequality is true. Therefore, the minimum value we need to find is c=1.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.