Maximize LCM

Revision en2, by fsociety00, 2018-12-01 17:27:50

How we can break 'n' into parts such that LCM of parts is maximum (number of parts should be greater than or equal to 2)? OR Find A1, A2, ..., Ak such that A1 + A2 + ... + Ak = n and LCM(A1, A2, ..., Ak) is maximum. Here 2 <= k <= n. Original Problem Link: http://acm.timus.ru/problem.aspx?space=1&num=1807

Tags #number theory, #dynamic-programming

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English fsociety00 2018-12-01 17:27:50 122 Tiny change: 'al to 2)? OR\nFind ' -> 'al to 2)? OR\nFind '
en1 English fsociety00 2018-12-01 17:09:33 238 Initial revision (published)