4 ms·
Maybe there's a prime number that makes a mildly interesting picture when rendered in base-2 in a 8*8 grid. Should somebody spend time looking at all the prime
by pavlov 2y ago
Maybe there's a prime number that makes a mildly interesting picture when rendered in base-2 in a 8*8 grid.
Should somebody spend time looking at all the primes that fit in the grid? Absolutely not.
- pavel_lishin 2y ago> Should somebody spend time looking at all the primes that fit in the grid? Absolutely not. Why not?
- pavlov 2y agoTrue, it’s not any of my business. Maybe superhuman AI will have humans do this kind of work to make us feel useful. “Oh, you’re right, does look a bit like a duck! Fun! You’re doing so well helping me discover the secrets of the universe! I enjoy working with people.”
- andrewla 2y agoYou can create your own using PARI/GP. To render the HN prime (a prime that has "HN" graphically with some garbage at the end, just go to [1] and type in: a = nextprime(0b1\ 0000000000000000\ 0100001010000010\ 0100001011000010\ 0100001010100010\ 0111111010010010\ 0100001010001010\ 0100001010000110\ 0100001010000010\ 0000000000000000\ 0000000000000000\ ) 1461507431067219818927492061258791363947404460153 is the HN prime (it looks better in binary and split to length-16 lines) >>> print("\n".join([bin(1461507431067219818927492061258791363947404460153)[3:][a*16:a*16+16] for a in range(10)])) 0000000000000000 0100001010000010 0100001011000010 0100001010100010 0111111010010010 0100001010001010 0100001010000110 0100001010000010 0000000000000000 0000000001111001 [1] https://pari.math.u-bordeaux.fr/gpwasm.html https://pari.math.u-bordeaux.fr/gpwasm.html