Nützliches des Studiums an der Universität Heidelberg

Continuation of RSA_numbers_factored.py gist, with transpiled RSA_numbers_factored.gp, RSA_numbers_factored.js and HTML demos

Providing prp and sqrtm1 code based on @paulunderwood's gw_utility.[ch] (which is based on gwnum lib)

This is oeis.org sequence A012132 as characterized by Sierpinski 1963

Ruin and Recreate

JavaScript playground for drawing planar graphs (eg. fullerenes) in browser

For visual analysis of cmp(x²+y²+z²,n) with cmp∈{≤,=}

sqrt(Mod(-3,M_I)) for Mersenne primes with 33<=i<=52, and conversion to integers x,y with M_i=x^2+3*y^2

[x,y,s] for top 10 known primes p with s²=-1 (mod p) and p=x²+y² (all above 6million decimal digits)

Make CGAL functionality available for PARI/GP

Create a random maximal planar (combinatorial) embedding

Create Proth.json containg all Proth primes k*2^m+1 with odd 0<k<1200 and all 0<m<3,600,000

Create planar random graphs, type in {cubic,cubic_Halin,maximal_planar,dual_of_cubic_Halin}

Provide 3D graphics for PARI/GP, by generating JSCAD output for view+navigate in browser

10:45:01h AMD 7600X computation of "sqrt(-1) (mod p)" for 9,383,761-digit prime p

Provide sum of four squares representation for Mersenne primes other than M_1

sqrt(-1) (mod p) as well as sum of squares p=x^2+y^2 for 6 Colbert primes p

About 6.7 day computation of "sqrt(-1) (mod p)" for 11,887,192-digit prime p, largest known prime =1 (mod 4)

performance investigations on non-expensive high single core performance CPU