olymmath

CMO 2000 Problem 4

  • Day 2

Given an ordered nn -tuple A=(a1,a2,⋯ ,an)A=(a_1,a_2,\cdots ,a_n) of real numbers, where n≥2n\ge 2 , we define bk=max⁡a1,…akb_k=\max{a_1,\ldots a_k} for each k. We define B=(b1,b2,⋯ ,bn)B=(b_1,b_2,\cdots ,b_n) to be the "innovated tuple" of AA . The number of distinct elements in BB is called the "innovated degree" of AA . Consider all permutations of 1,2,…,n1,2,\ldots ,n as an ordered nn -tuple. Find the arithmetic mean of the first term of the permutations whose innovated degrees are all equal to 22

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/2000/p4 · Tag 82SWRHTCW3 · Edit this page on GitHub · Keys: j next, k previous