Ciro Santilli @cirosantilli 35

Our definition is: about which culture a film is. Not who paid for it.

A directed weighted graph where the sum of weights of all outgoing edges equals 1.

A bit over the top, but convincing enough. A crypto-vampire show.

Semi-boring academic overview, but without reproducibility, or in a way that is too hidden for Ciro to have the patience to find it out.

Claims 1600 files found.

Mentions some upload mechanisms, notably AtomSea & EMBII and Satoshi uploader.

Ken Shirriff is a cool dude, he's done some collabs with Marc Verdiell in electronics restoration.

A convenient notation for the elements of $GF(n)$ of prime order is to use integers, e.g. for $GF(7)$ we could write:which makes it clear what is the additive inverse of each element, although sometimes a notation starting from 0 is also used:

For fields of prime order, regular modular arithmetic works as the field operation.

For non-prime order, we see that modular arithmetic does not work because the divisors have no inverse. E.g. at order 6, 2 and 3 have no inverse, e.g. for 2:we see that things wrap around perfecly, and 1 is never reached.

For non-prime prime power orders however, we can find a way, see finite field of non-prime order.