prime-numbers
Problem-solving strategies for prime numbers in graph number theory
Profile →npx skills add parcadei/Continuous-Claude-v3 --skill prime-numbers --agent claude-code
Same command for any agent — swap --agent for codex, cursor, copilot.
Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.
# 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 pyth
- When to Use
- Decision Tree
- Tool Commands
- SympyFactor
- Z3Primality
- SympyPrimeCount
- Z3FermatLittle
- Key Techniques
- Cognitive Tools Reference
uv run python -m runtime.harness scripts/sympy_compute.py factor "n" uv run python -m runtime.harness scripts/z3_solve.py prove "no_divisor_between_1_and_sqrt_n" uv run python -m runtime.harness scripts/sympy_compute.py simplify "pi(x) ~ x/ln(x)" uv run python -m runtime.harness scripts/z3_solve.py prove "a**(p-1) == 1 mod p"
What does the prime-numbers skill do?
Problem-solving strategies for prime numbers in graph number theory
How do I install it?
Run `npx skills add parcadei/Continuous-Claude-v3 --skill prime-numbers --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.
Where does this skill come from?
From parcadei/Continuous-Claude-v3, a repository with 3,879 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.
Is a popular skill a good skill?
Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.