jmikedupont2

.runtime/lock.info:#Project lock informations
.runtime/lock.info:#Sun Mar 18 11:09:15 EDT 2018
.runtime/lock.info:vmIdentifier=27721@mdupont-Aspire-7750G
.runtime/lock.info:version=1
.runtime/lock.info:user=mdupont
.runtime/lock.info:date=Sunday, March 18, 2018 11\:09\:15 AM EDT
.runtime/lock.info:hostName=192.168.1.79
data/.config/auditconfiguration.properties:#Audit configuration file.
data/.config/auditconfiguration.properties:#Format: ruleid = enabled|disabled|obsolete,tip|warning|error

jmikedupont2

=== ALLM.TXT ===
Source archive: cf7316f4-0bf3-4e38-b8b0-34f430244c28-aristotle.tar.gz
Generated: 2026-06-05 21:26:44 UTC
Selected files: f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/ARISTOTLE_SUMMARY.md, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/README.md, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/lean-toolchain, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/lake-manifest.json, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/lakefile.toml, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/Committees.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/Enforcement.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/Riddick.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/UCagreements.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/SenateManual.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/Main.lean, f02f42ce-3a45-421c-b515-a42b4dfa8e2d_aristotle/RequestProject/RulemakingStatutes.lean, f02f42ce-3

jmikedupont2

jmikedupont2

jmikedupont2

jmikedupont2

jmikedupont2

// ShaderToy version — uses iResolution and mainImage()

float sdRect(vec2 p, vec2 b) {
    vec2 d = abs(p) - b;
    return max(d.x, d.y);
}

float sdCircle(vec2 p, float r) {
    return length(p) - r;
}

jmikedupont2

# Use Sage inside Colab
#from sageall import *
from sage.all import *
import math
def is_supersingular_j(p, j):
    F = GF(p)
    jF = F(j)
    E = EllipticCurve_from_j(jF)
    n = E.cardinality()
    print("DEBUG2",p,j,F,jF,E,n)

jmikedupont2

Ogg primes ≤ 100:
DEBUG2 2 0 Finite Field of size 2 0 Elliptic Curve defined by y^2 + y = x^3 over Finite Field of size 2 3
DEBUG2 2 1 Finite Field of size 2 1 Elliptic Curve defined by y^2 + x*y = x^3 + 1 over Finite Field of size 2 4
DEBUG3 2 Finite Field in a of size 2^2 set() 0 Elliptic Curve defined by y^2 + y = x^3 over Finite Field in a of size 2^2 9
DEBUG3 2 Finite Field in a of size 2^2 {0} a Elliptic Curve defined by y^2 + x*y = x^3 + (a+1) over Finite Field in a of size 2^2 4
DEBUG3 2 Finite Field in a of size 2^2 {0} a + 1 Elliptic Curve defined by y^2 + x*y = x^3 + a over Finite Field in a of size 2^2 4
DEBUG3 2 Finite Field in a of size 2^2 {0} 1 Elliptic Curve defined by y^2 + x*y = x^3 + 1 over Finite Field in a of size 2^2 8
checking 2 True {0} {0} 1 1
DEBUG2 3 0 Finite Field of size 3 0 Elliptic Curve defined by y^2 = x^3 + x over Finite Field of size 3 4

jmikedupont2

# Source - https://stackoverflow.com/a/70638665
# Posted by Jérôme Richard
# Retrieved 2026-04-30, License - CC BY-SA 4.0

import numba as nb

@nb.njit('List(int_)(int_)')
def get_prime_divisors(n):
    divisors = []
    while n % 2 == 0: