prime-numbers

Problem-solving strategies for prime numbers in graph number theory

⭐2.2kstars🔀157forks📁View on GitHub🕐Updated Jan 10, 2026⬇️1downloads

When & Why to Use This Skill

This Claude skill provides advanced computational strategies and automated tools for solving complex prime number problems within graph number theory. By integrating Sympy for symbolic mathematics and Z3 for formal verification, it enables efficient primality testing, large-scale integer factorization, and the rigorous application of number theoretic theorems to research-level mathematical challenges.

Use Cases

  • Automated Primality Testing: Implementing a hierarchy of tests ranging from trial division to deterministic AKS algorithms for rigorous mathematical verification.
  • Advanced Integer Factorization: Utilizing Pollard's rho and quadratic sieve methods to decompose complex numbers for cryptographic analysis or theoretical research.
  • Theoretical Proof Verification: Proving modular arithmetic properties, such as Fermat's Little Theorem and Wilson's Theorem, using Z3 solvers and symbolic computation.
  • Prime Distribution Analysis: Calculating prime counts and gaps using the Prime Number Theorem to analyze patterns in graph number theory structures.
nameprime-numbers
description"Problem-solving strategies for prime numbers in graph number theory"
allowed-tools[Bash, Read]

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.