algorithm to slice a number into parts
RiderOfGiraffes: As others have said, your problem as stated is trivial.  Here's a degenerate solution:    n1 = n2 = ... = n(m-1) = 0
    nm = n

I'm sure that's not what you want.Here's another solution:    n1 = n2 = ... = nm = n/m

I'm sure that's not what you want either.Others have asked relevant questions.  Assuming you want the numbers to be integers, and as equal as possible, then compute:    k_min = floor(n/m)
    excess = n-k_min*m

All will be at least k_min.  If they are all k_min, then you will have a total of k_min*m.  You need an additional "excess", so assign them, one each, to the first bunch.    n1 = k_min + 1
    ...
    n(excess) = k_min + 1
    n(excess+1) = k_min
    ...
    nm = k_min

If you want you can reverse this so that the larger ones come after.  That's left as an exercise for the interested reader.You could also put all the excess in one place, so you have  n1 = n2 = ... = n(m-1) = k_min
  nm = k_min + excess

So really, it all depends on what you want.