Analyze Prime Numbers
Skill Verifiziert AktivAnalyze 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.
To provide a precise and reliable tool for determining primality, finding prime factorizations, and analyzing prime distributions for mathematical and computational tasks.
Funktionen
- Primality testing with trial division and Miller-Rabin
- Integer factorization using trial division and Pollard's rho
- Prime distribution analysis with Sieve of Eratosthenes
- Verification of results against published values and independent computation
- Detailed procedural steps and edge case handling
Anwendungsfälle
- Determining whether an integer is prime or composite
- Finding the complete prime factorization of an integer
- Counting or listing primes up to a given bound
- Investigating properties of primes in number-theoretic proofs
Nicht-Ziele
- Performing operations other than prime number analysis
- Handling non-integer inputs or non-mathematical tasks
- Providing advanced cryptographic factoring beyond Pollard's rho without explicit user request
Installation
/plugin install agent-almanac@pjt222-agent-almanacQualitätspunktzahl
VerifiziertVertrauenssignale
Ähnliche Erweiterungen
Explore Diophantine Equations
97Solve Diophantine equations (integer-only solutions) including linear, quadratic, and Pell equations. Covers the extended Euclidean algorithm, descent methods, and existence proofs. Use when finding all integer solutions to ax + by = c, solving Pell's equation, generating Pythagorean triples, proving no integer solutions exist via modular constraints, or finding the fundamental solution from which all others are generated.
Prove Geometric Theorem
100Prove geometric theorems using Euclidean axiomatic methods, coordinate geometry, or vector methods with rigorous step-by-step logical structure. Covers direct proof, proof by contradiction, coordinate proofs, vector proofs, and handling of special cases and degenerate configurations. Use when given a geometric statement to prove, verifying a conjecture, establishing a lemma, converting geometric intuition into a rigorous proof, or comparing the effectiveness of different proof methods.
Solve Trigonometric Problem
99Solve trigonometric equations and triangle problems systematically using identities, law of sines/cosines, inverse functions, and unit circle analysis. Covers equation solving, triangle resolution, identity verification, and applied trigonometric modeling. Use when solving trigonometric equations for unknown angles, resolving triangles from partial information (SSS, SAS, ASA), verifying identities, or applying trigonometry to real-world problems in surveying, physics, or engineering.
Derive Theoretical Result
99Derive a theoretical result step-by-step from first principles or established theorems, with every step explicitly justified and special cases checked. Use when deriving a formula or theorem from first principles, proving a mathematical statement by logical deduction, re-deriving a textbook result for verification or adaptation, extending a known result to a more general setting, or producing a self-contained derivation for a paper or thesis.
Solve Modular Arithmetic
98Solve modular arithmetic problems including congruences, systems via the Chinese Remainder Theorem, modular inverses, and Euler's theorem applications. Covers both manual and computational approaches. Use when solving linear congruences, computing modular inverses, evaluating large modular exponentiations, working with simultaneous congruences (CRT), or operating in cyclic groups and discrete logarithm contexts.