Math -> Pollard-Rho

Factor one 64-bit integer into prime factors with deterministic Miller-Rabin first and Pollard-Rho recursive splitting second.

• Topic slug: math/pollard-rho
• Tutorial page: Open tutorial
• Ladder page: Open ladder
• Repo problems currently tagged here: 1
• Repo companion pages: 4
• Curated external problems: 1

Microtopics

• pollard-rho
• miller-rabin-64bit
• factorize-u64
• prime-multiset
• recursive-splitting
• sorted-prime-factors

Learning Sources

Source	Type
cp-algorithms integer factorization	Reference
CP-Algorithms Library Factorize	Reference
Library Checker Factorize	Practice

Repo Companion Material

Material	Type
Pollard-Rho hot sheet	quick reference
Factorize	flagship note
Template Library exact starter route	starter route
Primitive Root	compare point

Curated External Problems

Core

Problem	Source	Difficulty	Context	Style	Prerequisites	Tags	Why it fits
Factorize	Library Checker	Hard	Integer Factorization	Math; Implementation	Modular Arithmetic; Fast Power; Prime Testing	Miller-Rabin; Prime Factorization; 64-Bit	The cleanest verifier for the repo's exact route: deterministic 64-bit primality plus Pollard-Rho recursive splitting with sorted prime-multiset output.

Repo Problems

Code	Title	Fit	Difficulty	Pattern	Note	Solution
FACTORIZE	Factorize	primary	hard	-	Note	Code

Regeneration

python3 scripts/generate_problem_catalog.py