olymmath

SIMON-MARAIS 2023 A2

  • Paper A

Let nn be a positive integer and let f1(x),…,fn(x)f_1(x), \ldots, f_n(x) be affine functions from R\mathbb{R} to R\mathbb{R} such that, amongst the nn graphs of these functions, no two are parallel and no three are concurrent. Let SS be the set of all convex functions g(x)g(x) from R\mathbb{R} to R\mathbb{R} such that for each x∈Rx \in \mathbb{R}, there exists ii such that g(x)=fi(x)g(x) = f_i(x).

Determine the largest and smallest possible values of ∣S∣|S| in terms of nn.

(A function f(x)f(x) is affine if it is of the form f(x)=ax+bf(x) = ax + b for some a,b∈Ra, b \in \mathbb{R}. A function g(x)g(x) is convex if g(λx+(1−λ)y)≤λg(x)+(1−λ)g(y)g(\lambda x + (1 - \lambda)y) \leq \lambda g(x) + (1 - \lambda)g(y) for all x,y∈Rx, y \in \mathbb{R} and 0≤λ≤10 \leq \lambda \leq 1.)

Official text Simon Marais Mathematics Competition 2023 official paper, page 2. Quoted with source.

A model read this text from the scan of the paper by OCR, with vision/local (GLM-OCR-8bit). No person has checked it against the paper yet.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator simon-marais/2023/a2 · Tag Y2BF27BYT8 · Edit this page on GitHub · Keys: j next, k previous