Problem #PRU-60901

Problems Number theory Numeral systems

Problem

Given a natural number \(n\) you are allowed to perform two operations: "double up", namely get \(2n\) from \(n\), and "increase by \(1\)", i.e. to get \(n+1\) from \(n\). Find the smallest amount of operations one needs to perform to get the number \(n\) from \(1\).