The permutation that minimizes the sum of floor(p[i]/i)

Revision en1, by yariss, 2024-04-30 23:11:29

Given n, how can we construct a permutation p of size n, such that the sum of p[i]/i is minimized?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English yariss 2024-04-30 23:12:34 7 Tiny change: 'he sum of p[i]/i is minimi' -> 'he sum of floor(p[i]/i) is minimi'
en1 English yariss 2024-04-30 23:11:29 153 Initial revision (published)