olymmath

CMO 1996 Problem 5

  • Paper

Let r1r_1 , r2r_2 , …\ldots , rmr_m be a given set of mm positive rational numbers such that ∑k=1mrk=1\sum_{k=1}^m r_k = 1 . Define the function ff by f(n)=n−∑k=1m [rkn]f(n)= n-\sum_{k=1}^m \: [r_k n] for each positive integer nn . Determine the minimum and maximum values of f(n)f(n) . Here  [x]{\ [ x ]} denotes the greatest integer less than or equal to xx .

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 ca-cmo/1996/p5 · Tag FF9SRFGZK1 · Edit this page on GitHub · Keys: j next, k previous