On the solution of linear recurrence equations

In this article, we present a general solution for linear divide-and-conquer recurrences of the form un = ∑^ki=1 aiu⌊n/bi⌋ + g(n). Our approach handles more cases than the Master method does. We achieve this advantage by defining a new transform – the Order transform – which has useful properties for providing asymptotic answers (compared to other transforms which supply exact answers). This transform helps in mapping the sequence under consideration to the two dimensional plane where the solution becomes easier to obtain. We demonstrate the power of the final results by solving many ‘difficult’ examples.