Skip to content
View jorgell23-sys's full-sized avatar

Highlights

  • Pro

Block or report jorgell23-sys

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Content in all repositories owned by your account will be closed.
Maximum 250 characters. Please don’t include any personal information such as legal names or email addresses. Markdown is supported. This note will only be visible to you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse

Popular repositories Loading

  1. mdcx mdcx Public

    Convert a document collection to verified Markdown, package it into a single encrypted archive with its search index and provenance, and serve it to agents over the Model Context Protocol. Python 3…

    Python 2

  2. covering-digraph-girth covering-digraph-girth Public

    The least n with rad(n) | f(n) whose covering digraph has girth k, for eleven arithmetic functions and k = 2..10: 52 values proved minimal, 38 of them computed here for the first time, with a surge…

    Python

  3. squarefree-shifted-prime-products squarefree-shifted-prime-products Public

    Squarefree n dividing the product of (p+b) over its own prime divisors. Membership depends only on b mod n, and S_b is finite for every b by a bound that is really a statement about arithmetic prog…

    Python

  4. uncoverable-primes uncoverable-primes Public

    For S(f) = { n : rad(n) divides f(n) }, entire congruence classes of primes divide no element at all: none of S(sigma*_2) is divisible by a prime 3 mod 4, none of S(Phi_3) by a prime 2 mod 3. Also:…

    Python

  5. covered-but-excluded-primes covered-but-excluded-primes Public

    A prime having an incoming arrow in the covering digraph of f is necessary but not sufficient for it to divide an element of S(f) = { n : rad(n) | f(n) }: for f(q^e) = q^(2e) - q^e + 1 the prime 3 …

    Python