1. The problem statement, all variables and given/known data
If I had a recurrence expression that recurs on partitions of size n  1 each time, (as opposed some fraction of the original size ie. n/2), how can I apply the Master Theorem? I don't know what the "b" value is?
2. Relevant equations
3. The attempt at a solution
ie. If I had 2 C(n1) + f(n), what is b?
