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 1

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 1

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 1

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 1

6. prime-abundant-enumeration prime-abundant-enumeration Public

   The n with rad(n) | sigma(n) (OEIS A175200) listed without sieving, to 10^13: 85,695 terms where the published b-file has 10,000. Includes the counts of prime-perfect numbers to 10^13 and six invar…

   Python 1