[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6NVCZ94NJYDHDYGMMCVV0F8":3,"skill-same:01M6NVCZ94NJYDHDYGMMCVV0F8":59},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":30,"linkOnly":31,"markdownContent":32,"markdownBody":33,"frontMatter":34,"refName":37,"commitSha":38,"skillDirectory":39,"forksCount":14,"repositoryHtmlUrl":40,"repositoryHomepageUrl":6,"ownerHtmlUrl":41,"ownerBlogUrl":42,"ownerDescription":43,"updatedAt":44,"install":45,"resources":58},"01M6NVCZ94NJYDHDYGMMCVV0F8","modular-arithmetic",null,"Problem-solving strategies for modular arithmetic in graph number theory","rubicanjr\u002FFinCognis","rubicanjr","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F234912519?v=4","01M6NT156NND8J474G34SB3923","Rubi","01M6NT15B70RWXE1N3YV0BZY8A",0,"MIT","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Fgraph-number-theory\u002Fmodular-arithmetic\u002FSKILL.md",[],[19,20,21,22,23,24,25,26,27,28,29],"modular","modular arithmetic","graph","Bash","read","problem-solving","strategies","number theory","problem","number","for","2026-11-10 10:12:30",false,"---\nname: modular-arithmetic\ndescription: \"Problem-solving strategies for modular arithmetic in graph number theory\"\nallowed-tools: [Bash, Read]\n---\n\n# Modular Arithmetic\n\n## When to Use\n\nUse this skill when working on modular-arithmetic problems in graph number theory.\n\n## Decision Tree\n\n\n1. **Extended Euclidean Algorithm**\n   - Find gcd(a,b) and x,y with ax + by = gcd(a,b)\n   - Modular inverse: a^{-1} mod n when gcd(a,n) = 1\n   - `sympy_compute.py solve \"a*x == 1 mod n\"`\n\n2. **Chinese Remainder Theorem**\n   - System x = a_i (mod m_i) with coprime m_i\n   - Unique solution mod prod(m_i)\n   - `z3_solve.py prove \"crt_solution_exists\"`\n\n3. **Euler's Theorem**\n   - a^{phi(n)} = 1 (mod n) when gcd(a,n) = 1\n   - phi(p^k) = p^{k-1}(p-1)\n   - `sympy_compute.py simplify \"euler_phi\"`\n\n4. **Quadratic Residues**\n   - Legendre symbol: (a\u002Fp) = a^{(p-1)\u002F2} mod p\n   - Quadratic reciprocity: (p\u002Fq)(q\u002Fp) = (-1)^{...}\n   - Tonelli-Shanks for square roots\n\n5. **Order and Primitive Roots**\n   - ord_n(a) = smallest k with a^k = 1 (mod n)\n   - Primitive root: ord_n(a) = phi(n)\n\n\n## Tool Commands\n\n### Sympy_Mod_Inverse\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py solve \"a*x == 1 mod n\" --var x\n```\n\n### Z3_Crt\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"solution_exists_iff_pairwise_coprime\"\n```\n\n### Sympy_Euler_Phi\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"phi(p**k) == p**(k-1)*(p-1)\"\n```\n\n### Z3_Quadratic_Residue\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"legendre_symbol_multiplicative\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Graph Theory (Graduate Texts in Mathematics (173))] By N we denote the set of natural numbers, including zero. The set Z\u002FnZ of integers modulo n is denoted by Zn; its elements are written as i := i + nZ. When we regard Z2 = {0, 1} as a eld, we also denote it as F2 = {0, 1}.\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n","# Modular Arithmetic\n\n## When to Use\n\nUse this skill when working on modular-arithmetic problems in graph number theory.\n\n## Decision Tree\n\n\n1. **Extended Euclidean Algorithm**\n   - Find gcd(a,b) and x,y with ax + by = gcd(a,b)\n   - Modular inverse: a^{-1} mod n when gcd(a,n) = 1\n   - `sympy_compute.py solve \"a*x == 1 mod n\"`\n\n2. **Chinese Remainder Theorem**\n   - System x = a_i (mod m_i) with coprime m_i\n   - Unique solution mod prod(m_i)\n   - `z3_solve.py prove \"crt_solution_exists\"`\n\n3. **Euler's Theorem**\n   - a^{phi(n)} = 1 (mod n) when gcd(a,n) = 1\n   - phi(p^k) = p^{k-1}(p-1)\n   - `sympy_compute.py simplify \"euler_phi\"`\n\n4. **Quadratic Residues**\n   - Legendre symbol: (a\u002Fp) = a^{(p-1)\u002F2} mod p\n   - Quadratic reciprocity: (p\u002Fq)(q\u002Fp) = (-1)^{...}\n   - Tonelli-Shanks for square roots\n\n5. **Order and Primitive Roots**\n   - ord_n(a) = smallest k with a^k = 1 (mod n)\n   - Primitive root: ord_n(a) = phi(n)\n\n\n## Tool Commands\n\n### Sympy_Mod_Inverse\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py solve \"a*x == 1 mod n\" --var x\n```\n\n### Z3_Crt\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"solution_exists_iff_pairwise_coprime\"\n```\n\n### Sympy_Euler_Phi\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"phi(p**k) == p**(k-1)*(p-1)\"\n```\n\n### Z3_Quadratic_Residue\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"legendre_symbol_multiplicative\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [Graph Theory (Graduate Texts in Mathematics (173))] By N we denote the set of natural numbers, including zero. The set Z\u002FnZ of integers modulo n is denoted by Zn; its elements are written as i := i + nZ. When we regard Z2 = {0, 1} as a eld, we also denote it as F2 = {0, 1}.\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n",{"name":5,"description":7,"allowed-tools":35},[22,36],"Read","main","70e1c350500ee750987420bbae48837afa906b7e","skills\u002Fmath\u002Fgraph-number-theory\u002Fmodular-arithmetic","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis","https:\u002F\u002Fgithub.com\u002Frubicanjr","linktr.ee\u002Ffinanskodu","Industrial Engineer & CIO @FinansKodu. Architecting AI-driven financial agents and autonomous workflows. 🏗️ Building systems, not just prompts.","2026-06-09 13:50:15",{"source":8,"skillName":5,"commands":46,"prompt":56,"zipAvailable":57},[47,50,53],{"tool":48,"command":49},"npx","npx skills add rubicanjr\u002FFinCognis --skill modular-arithmetic",{"tool":51,"command":52},"bunx","bunx skills add rubicanjr\u002FFinCognis --skill modular-arithmetic",{"tool":54,"command":55},"pnpm","pnpm dlx skills add rubicanjr\u002FFinCognis --skill modular-arithmetic","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Fgraph-number-theory\u002Fmodular-arithmetic\u002FSKILL.md",true,[],[60,81,90,109,138,157],{"skillNo":61,"name":62,"nameZh":6,"description":63,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":64,"categories":65,"keywords":71,"publishedAt":30},"01M6NWS9DAXJTADT4T5MB49X8W","workflow-router","Goal-based workflow orchestration - routes tasks to specialist agents based on user goals","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fworkflow-router\u002FSKILL.md",[66],{"categoryNo":67,"categoryName":68,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[72,73,74,75,76,77,78,79,80],"workflow router","workflow","router","orchestration","goals","goal","user","workflow orchestration","tasks",{"skillNo":82,"name":83,"nameZh":6,"description":84,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":85,"categories":86,"keywords":87,"publishedAt":30},"01M6NWS3RETSC0SHP16HP66E14","wiring","Wiring Verification","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwiring\u002FSKILL.md",[],[83,88,89],"verification","false",{"skillNo":91,"name":92,"nameZh":6,"description":93,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":94,"categories":95,"keywords":99,"publishedAt":30},"01M6NWS0XW9CVQZBDA1EGW0TWC","websocket-patterns","Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwebsocket-patterns\u002Fskill.md",[96],{"categoryNo":97,"categoryName":98,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000015","视觉设计",[100,101,102,103,104,105,106,25,107,108],"websocket","patterns","websocket patterns","design","protocol","management","message","binary","connection",{"skillNo":110,"name":111,"nameZh":6,"description":112,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":113,"categories":114,"keywords":119,"publishedAt":30},"01M6NWRDQDX9ZNETAWRRMQWV52","visual-verdict","Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS\u002FREVISE\u002FFAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvisual-verdict\u002FSKILL.md",[115,118],{"categoryNo":116,"categoryName":117,"taxonomyType":69,"taxonomyTypeDesc":70},"01JBSEEDCAT000000000000009","前端开发",{"categoryNo":67,"categoryName":68,"taxonomyType":69,"taxonomyTypeDesc":70},[120,121,122,123,124,125,126,127,128,29,129,130,131,103,132,133,134,135,136,137],"visual","verdict","visual verdict","ui","across","revise","comparison","correctness","implementing","fixes","dimensions","frontend","development","qa","screenshot","returns","use","frontend development",{"skillNo":139,"name":140,"nameZh":6,"description":141,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":142,"categories":143,"keywords":144,"publishedAt":30},"01M6NWR8HSNRS7MNDK2J02QYMN","verification-loop","Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fverification-loop\u002FSKILL.md",[],[145,146,88,147,148,149,150,151,152,153,154,155,156],"verification loop","loop","lint","review","security","pr","system","diff","build","tests","diff review","types",{"skillNo":158,"name":159,"nameZh":6,"description":160,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":161,"categories":162,"keywords":163,"publishedAt":30},"01M6NWR4HHSFR0VR5EXFRWA747","vector-db-patterns","Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvector-db-patterns\u002Fskill.md",[],[164,165,166,167,101,168,169,170,171,25,172,173,174,175,176,29,177,178],"vector db patterns","vector db","db","vector","semantic search","search","embedding strategies","algorithms","chunking","semantic","retrieval","embedding","Hybrid Search","hybrid","rag"]