Prime Numbers
- 1 installs
- 3.9k repo stars
- Updated January 26, 2026
- parcadei/continuous-claude-v3
Guides Claude through prime-number problems using a primality-testing hierarchy and factorization strategies.
About
A decision-tree skill for prime numbers, choosing among trial division, Miller-Rabin, and AKS primality tests plus factorization. A developer uses it when they want Claude to test primality or factor integers.
- Primality-testing hierarchy by complexity
- Factorization via trial division and beyond
Prime Numbers by the numbers
- 1 all-time installs (skills.sh)
- Ranked #1,803 of 2,064 Data Science & ML skills by installs in the Skillselion catalog
- Data as of Aug 5, 2026 (Skillselion catalog sync)
npx skills add https://github.com/parcadei/continuous-claude-v3 --skill prime-numbersAdd your badge
Show developers this skill is listed on Skillselion. Paste this into your README.
| Installs | 1 |
|---|---|
| repo stars | ★ 3.9k |
| Last updated | January 26, 2026 |
| Repository | parcadei/continuous-claude-v3 ↗ |
What it does
Guides Claude through prime-number problems using a primality-testing hierarchy and factorization strategies.
Files
Prime Numbers
When to Use
Use this skill when working on prime-numbers problems in graph number theory.
Decision Tree
1. Primality testing hierarchy
- Trial division: O(sqrt(n)), exact
- Miller-Rabin: O(k log^3 n), probabilistic
- AKS: O(log^6 n), deterministic polynomial
2. Factorization
- Trial division for small factors
- Pollard's rho: probabilistic, medium numbers
- Quadratic sieve: large numbers
sympy_compute.py factor "n"
3. Prime distribution
- Prime Number Theorem: pi(x) ~ x/ln(x)
- Prime gaps: p_{n+1} - p_n
sympy_compute.py limit "pi(x) * ln(x) / x"
4. Fermat's Little Theorem
- a^{p-1} = 1 (mod p) for a not divisible by p
- Use for modular exponentiation
z3_solve.py prove "fermat_little"
5. Wilson's Theorem
- (p-1)! = -1 (mod p) iff p is prime
Tool Commands
Sympy_Factor
uv run python -m runtime.harness scripts/sympy_compute.py factor "n"Z3_Primality
uv run python -m runtime.harness scripts/z3_solve.py prove "no_divisor_between_1_and_sqrt_n"Sympy_Prime_Count
uv run python -m runtime.harness scripts/sympy_compute.py simplify "pi(x) ~ x/ln(x)"Z3_Fermat_Little
uv run python -m runtime.harness scripts/z3_solve.py prove "a**(p-1) == 1 mod p"Key Techniques
From indexed textbooks:
Cognitive Tools Reference
See .claude/skills/math-mode/SKILL.md for full tool documentation.
Related skills
Microsoft FoundryDeploy, evaluate, and continuously improve Microsoft Foundry agents from a single agent interface.490k1.3k
Ai Research ReproductionOrchestrate trustworthy, auditable reproduction of deep learning repositories directly from their READMEs.176k511Run TrainSafely execute selected deep learning training commands with standardized evidence capture.176k511Explore RunSafely run isolated exploratory experiments with clear recording and conservative selection before committing changes.176k511Paper Context ResolverFetch precise reproduction-critical details like dataset splits, preprocessing steps, or evaluation protocols from the original academic paper when the repo README leav141k511Repo Intake And PlanScan unfamiliar AI research repositories and receive a minimal, trustworthy reproduction target before investing significant time.140k511