olymmath

AMO-Bench 2025 Problem 38

  • Answer

In a dd-dimensional Euclidean space, there are two definitions:

  1. Encapsulation: For a point pp, if there exists a ball centered at pp with sufficiently small radius such that every point within this ball (except pp itself) belongs to at least one convex set KiK_i (where i=1,…,ni=1, \dots, n), then we say point pp is encapsulated by these convex sets;
  2. Contact: For a set KK and a point pp, if pp does not lie inside KK but any neighborhood of pp (no matter how small) contains points from KK, we say point pp contacts set KK (This is equivalent to saying pp is a boundary point of KK). Let K1,K2,K3K_1, K_2, K_3 be three convex sets in dd-dimensional space. Let SS be the set of points encapsulated by these three convex sets. The maximum possible value of ∣S∣|S| is a function theat depends only on the dimension dd. Based on the above definitions and known conditions, the maximum value can be derived. Let f(d,3)=max⁡∣S∣f(d, 3) = \max |S|. Please provide the expression for f(d,3)f(d, 3): f(d,3)=f(d, 3) =

Dataset text AMO-Bench. Open licence.

Show the answer

⌊3d2⌋+1\lfloor \frac{3d}{2} \rfloor + 1, where ⌊⌋\lfloor \quad \rfloor denotes the floor function (rounding down to the nearest integer).

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 amo-bench/2025/p38 · Tag 9BANV6FTMW · Edit this page on GitHub · Keys: j next, k previous