title: Number of steps taken to split a number
body: <p>I cannot get my head around this:</p>
  
  <p>Say I got a number 9. I want to know the minimum steps needed to split it so that no number is greater than 3.</p>
  
  <p>I always thought that the most efficient way is to halve it every loop.
  So, 9 -> 4,5 -> 2,2,5 -> 2,2,2,3 so 3 steps in total. However, I just realised a smarter way: 9 -> 3,6 -> 3,3,3 which is 2 steps only...</p>
  
  <p>After some research, the number of steps is in fact (n-1)/target, where target=3 in my example.</p>
  
  <p>Can someone please explain this behaviour to me?</p>