Thinking about random math things... I wonder if someone has studied the number theory gap between regular numbers and IEEE 754 numbers.
Things like: which prime number theorems do not hold in general, but do hold for 32 or 64 bit floats?
Or, do complex numbers have some nifty extra properties in IEEE 754 that do not hold for normal numbers?
=> More informations about this toot | More toots from jon_valdes@mastodon.gamedev.place
Just found a (pretty dumb) one for 32 bit uints. All Fermat numbers are primes in the U32 range:
https://en.wikipedia.org/wiki/Fermat_number
The first Fermat number that isn't a prime is 2^32 + 1. So, by quite a narrow margin, all the u32 Fermat numbers are primes :)
=> More informations about this toot | More toots from jon_valdes@mastodon.gamedev.place
@jon_valdes that’s handy!
=> More informations about this toot | More toots from JonOlick@mastodon.gamedev.place This content has been proxied by September (3851b).Proxy Information
text/gemini