Every premium and members-only resource for $9.99/month, as a no-commitment subscription. See the plans

PalateKit

Sign in
Menu

Request a resource

Describe the resource you are missing in one sentence. We will email you when it is published.

0 / 280

A page, a video or an image online.

Unlock PalateKit

Unlock everything

Plan

Paying means accepting our terms of sale.

Secure payment by Stripe. Receipts and invoices sent by email.

Welcome back

Sign in to install, download or save this resource. A free account is enough for free resources.

Modular arithmetic: inverse, Chinese remainder, Euler v1.0.0

Use this resource to solve a congruence or a system of congruences

New

  • 508 downloads
  • 225 likes
  • 248 saves

Free

Install with the CLI

In a terminal, from the folder you want:

npx --yes palatekit@latest install modular-congruence-solving

With no option, the skill goes to ~/.agents/skills/; add --agent claude-code (or codex, cursor…) to target an agent.

First time: connect the CLI with

npx --yes palatekit@latest login

The agent computes the modular inverse with the extended Euclidean algorithm, solves congruence systems with the Chinese remainder theorem and then applies Euler's function. It checks the answers with SymPy and Z3. You get a verified solution.

Mostly picked by

Updated November 2, 2026

Card for the “Modular arithmetic: inverse, Chinese remainder, Euler” skill

Details

Works in
Install guides
Generates with
Your agent's model
Licence
MIT

Similar resources

View all

What you get

  • SKILL.md: decision tree (extended Euclid, Chinese remainder, Euler, quadratic residues)
  • SKILL.md: SymPy commands (inverse, phi) and Z3 (remainders, residues)

Good fit for

  • You need to find the inverse of a number modulo n
  • You solve a system of congruences with pairwise coprime moduli

Not for

    Tags

    • modular arithmetic
    • congruences
    • Chinese remainder theorem
    • Euler

    About

    You say

    “Find x such that x ≡ 2 mod 3 and x ≡ 3 mod 5.”

    Card for the “Modular arithmetic: inverse, Chinese remainder, Euler” skill

    Skill published by parcadei under the MIT license, delivered in its original version.

    Show more

    How to use it

    1. Install the skill in your agent's skills folder
    2. Ask your agent to solve a congruence or a system of congruences
    3. Review and adjust the result

    Content preview

    Files

    • LICENSE1.1 KB
    • NOTICE-PALATEKIT.md0.5 KB
    • SKILL.md2 KB

    Origin and licence

    Listed unmodified

    Author
    parcadei
    Source
    github.com/parcadei/continuous-claude-v3/tree/d07ff4b06b62f43771bc0c927d0211b734d6149e/.claude/skills/math/graph-number-theory/modular-arithmetic
    Licence
    MIT

    Notice

    « modular-arithmetic » (parcadei, MIT) livré dans sa version d'origine : fiche en français et en anglais par PalateKit.

    User reviews

    –

    No ratings yet

    Loading reviews…

    Delete your review?

    Your rating and comment will be removed from the page.