Recurrence Solver
SkillDev toolsSolve recurrence relations using multiple methods including Master Theorem and generating functions
Instructions available. Your AI can read the instructions. Execution depends on the setup they require.
Account requirements not reviewed. Check the skill instructions before use; ahel provides instructions and does not run this skill.
Add ahel to your AI once: Claude, ChatGPT, Cursor, Claude Code or Codex. Then ask it to use this.
Then ask your AI: use the Recurrence Solver skill
What this skill tells your AI
The instructions your AI receives, as published by a5c-ai/babysitter in library/specializations/domains/science/computer-science/skills/recurrence-solver/SKILL.md and read by ahel’s review.
Purpose
Provides expert guidance on solving recurrence relations arising from divide-and-conquer and recursive algorithm analysis.
Capabilities
- Apply Master Theorem (all three cases)
- Substitution method with guess verification
- Recursion tree analysis with visualization
- Generating functions for complex recurrences
- Akra-Bazzi method for generalized recurrences
- Handle non-standard recurrence forms
Usage Guidelines
- Recognition: Identify recurrence structure and applicable methods
- Master Theorem: Check and apply Master Theorem cases
- Substitution: Formulate and verify guess for complex cases
- Tree Analysis: Build recursion tree for intuition
- Verification: Validate solutions with base cases
Tools/Libraries
- SymPy
- Visualization libraries
- Symbolic algebra systems
Signals
- GitHub stars
- 2k
- Forks
- 112
- Last commit
- Sep 2026
Advanced
- Item type
- skill
- Key
recurrence-solver- Source
- github.com/a5c-ai/babysitter