Popular repositories Loading
-
covering-digraph-girth
covering-digraph-girth PublicThe 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
-
squarefree-shifted-prime-products
squarefree-shifted-prime-products PublicSquarefree 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
-
uncoverable-primes
uncoverable-primes PublicFor 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
-
covered-but-excluded-primes
covered-but-excluded-primes PublicA 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
If the problem persists, check the GitHub status page or contact support.
