olymmath

ELMO SL 2010 A5

    Given a prime pp , let d(a,b)d(a,b) be the number of integers cc such that 1≤c<p1 \leq c < p , and the remainders when acac and bcbc are divided by pp are both at most p3\frac{p}{3} . Determine the maximum value of ∑a=1p−1∑b=1p−1d(a,b)(xa+1)(xb+1)−∑a=1p−1∑b=1p−1d(a,b)xaxb\sqrt{\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}d(a,b)(x_a + 1)(x_b + 1)} - \sqrt{\sum_{a=1}^{p-1}\sum_{b=1}^{p-1}d(a,b)x_ax_b} over all (p−1)(p-1) -tuples (x1,x2,…,xp−1)(x_1,x_2,\ldots,x_{p-1}) of real numbers.

    Brian Hamrick.

    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 elmo-sl/2010/a5 · Tag 2PRAH06MH5 · Edit this page on GitHub · Keys: j next, k previous