prime-numbers
FeaturedProblem-solving strategies for prime numbers in graph number theory
AI & Automation 3,951 stars
303 forks Updated 2 days ago MIT
Install
Quality Score: 94/100
Stars 20%
Recency 20%
Frontmatter 20%
Documentation 15%
Issue Health 10%
License 10%
Description 5%
Skill Content
# 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
```bash
uv run python -m runtime.harness scripts/sympy_compute.py factor "n"
```
### Z3_Primality
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "no_divisor_between_1_and_sqrt_n"
```
### Sympy_Prime_Count
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "pi(x) ~ x/ln(x)"
```
### Z3_Fermat_Little
```bash
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.
Details
- Author
- parcadei
- Repository
- parcadei/Continuous-Claude-v3
- Created
- 11 months ago
- Last Updated
- 2 days ago
- Language
- Python
- License
- MIT
Similar Skills
Semantically similar based on skill content — not just same category
AI & Automation Solid
prime-numbers
Problem-solving strategies for prime numbers in graph number theory
552 Updated 6 days ago
vibeeval AI & Automation Listed
analyze-prime-numbers
Analyze prime numbers using primality tests, factorization algorithms, prime distribution analysis, and sieve methods. Covers trial division, Miller-Rabin, Sieve of Eratosthenes, and the Prime Number Theorem. Use when determining whether an integer is prime or composite, finding prime factorizations, counting or listing primes up to a bound, or investigating prime properties within a number-theoretic proof or computation.
45 Updated today
pjt222 AI & Automation Featured
modular-arithmetic
Problem-solving strategies for modular arithmetic in graph number theory
3,951 Updated 2 days ago
parcadei