benchmarks.wiki / Public workspace
OlympiadBench / 1998 / Let R_(>0) be the set of positive real numbers. Find all functions…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
answer type
Expression
is multiple answer
false
language
English
question
Let be the set of positive real numbers. Find all functions such that, for every , there exists a unique satisfying
Plain-text mathematical notation (without MathML)
Let R_(>0) be the set of positive real numbers. Find all functions f:R_(>0)→R_(>0) such that, for every x∈R_(>0), there exists a unique y∈R_(>0) satisfying xf(y)+yf(x)≤2.
Original LaTeX notation
Let $\mathbb{R}_{>0}$ be the set of positive real numbers. Find all functions $f: \mathbb{R}_{>0} \rightarrow \mathbb{R}_{>0}$ such that, for every $x \in \mathbb{R}_{>0}$, there exists a unique $y \in \mathbb{R}_{>0}$ satisfying
$$
x f(y)+y f(x) \leqslant 2 .
$$question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
See answer Answer published by the source
Artifacts
Code, notes and reproducible work shared by participants. Files are served from a separate origin.
No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import