olymmath

CMO 1998 Problem 6

  • Day 2

Let x1,x2,…,xnx_1,x_2,\ldots ,x_n be real numbers, where n≥2n\ge 2 , satisfying ∑i=1nxi2+∑i=1n−1xixi+1=1\sum_{i=1}^{n}x^2_i+ \sum_{i=1}^{n-1}x_ix_{i+1}=1 . For each kk , find the maximal value of ∣xk∣|x_k| .

Dataset text AI-MO AoPS. Quoted with source.

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 cn-mo/1998/p6 · Tag 2VG0K0TXMY · Edit this page on GitHub · Keys: j next, k previous