An instance of size `n` is divided into `p≥2` instances each of size `n-a` where `a` is a small `integer` and `p` is a `constant`. The computation cost of this operation (i.e. dividing into instances) is a unit, with `C(0)=1.`

I am trying to find the complexity of this design. I am having trouble putting the words into an equation, here is what I think the recursion should look like:

```
C(n) = (n-a)*C(n/p) + 1

```

is this correct?