Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Note: I have converted my announcement into a question and supplied an answer.

What is the best way to solve discrete divide and conquer recurrences?

The "Master Theorem" is one way.

What other ways are available?

share|improve this question
Questions on any SE site should be questions. This would be more appropriate for a personal blog or something of that nature. –  Alex Becker Jul 2 '13 at 0:51
Given the amount of traffic this site sees regarding the Master Theorem and Mellin transform methods, which is considerable, I think a good case can be made for keeping the announcement of this brilliant paper. It may well be that a tag "announcement" would be appropriate for postings of this sort. –  Marko Riedel Jul 2 '13 at 1:28
I don't have a blog or a website. I agree that this is not a question, but think that it it appropriate for this site perhaps, as Marko said, as an announcement. –  marty cohen Jul 2 '13 at 2:34
See my comment. –  marty cohen Jul 2 '13 at 2:34
I made it a question. –  marty cohen Jul 4 '13 at 17:50

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.