recurrence-solver

Solve recurrence relations using multiple methods including Master Theorem and generating functions

509 stars

bya5c-ai

View on GitHub Installation ↓

Best use case

recurrence-solver is best used when you need a repeatable AI agent workflow instead of a one-off prompt.

Solve recurrence relations using multiple methods including Master Theorem and generating functions

Teams using recurrence-solver should expect a more consistent output, faster repeated execution, less prompt rewriting.

When to use this skill

You want a reusable workflow that can be run more than once with consistent structure.

When not to use this skill

You only need a quick one-off answer and do not need a reusable workflow.
You cannot install or maintain the underlying files, dependencies, or repository context.

Installation

Claude Code / Cursor / Codex

$curl -o ~/.claude/skills/recurrence-solver/SKILL.md --create-dirs "https://raw.githubusercontent.com/a5c-ai/babysitter/main/library/specializations/domains/science/computer-science/skills/recurrence-solver/SKILL.md"

Manual Installation

Download SKILL.md from GitHub
Place it in .claude/skills/recurrence-solver/SKILL.md inside your project
Restart your AI agent — it will auto-discover the skill

How recurrence-solver Compares

Feature / Agent	recurrence-solver	Standard Approach
Platform Support	Not specified	Limited / Varies
Context Awareness	High	Baseline
Installation Complexity	Unknown	N/A

Frequently Asked Questions

What does this skill do?

Solve recurrence relations using multiple methods including Master Theorem and generating functions

Where can I find the source code?

You can find the source code on GitHub using the link provided at the top of the page.

SKILL.md Source

# Recurrence Solver

## 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

1. **Recognition**: Identify recurrence structure and applicable methods
2. **Master Theorem**: Check and apply Master Theorem cases
3. **Substitution**: Formulate and verify guess for complex cases
4. **Tree Analysis**: Build recursion tree for intuition
5. **Verification**: Validate solutions with base cases

## Tools/Libraries

- SymPy
- Visualization libraries
- Symbolic algebra systems