Problem

Source: Romania TST 2023 Day 1 P1

Tags: number theory, sum of digits



Let $m$ and $n$ be positive integers, where $m < 2^n.$ Determine the smallest possible number of not necessarily pairwise distinct powers of two that add up to $m\cdot(2^n- 1).$ The Problem Selection Committee