As per <classification of finite fields> those must be of <prime power> order.

<video Finite fields made easy by Randell Heyman (2015)> at https://youtu.be/z9bTzjy4SCg?t=159 shows how for order $9 = 3 \times 3$. Basically, for order $p^n$, we take:
* each element is a polynomial in $GF(p)[x]$, $GF(p)[x]$, the <polynomial over a field>[polynomial ring over the finite field $GF(p)$] with degree smaller than $n$. We've just seen how to construct $GF(p)$ for prime $p$ above, so we're good there.
* addition works element-wise modulo on $GF(p)$
* multiplication is done modulo an <irreducible polynomial> of order $n$
For a worked out example, see: <GF(4)>.


Finite field of non-prime order

Fluorescent tag

Free radical

Open access academic publisher

{title2=\sup[1]H}
{title2=stable}
{title2=99.98%}
{wiki}


Protium

Recurse Center

Somatic cell

Splash screen

SQL FUNCTION keyword

* https://www.wired.com/story/tiktok-platforms-cory-doctorow/
* https://www.theguardian.com/commentisfree/2023/mar/11/users-advertisers-we-are-all-trapped-in-the-enshittification-of-the-internet


The Enshittification of the Internet

Time to Hello World

{disambiguate=school}
{wiki}

No teachers, no courses, no tuition fees. Yes please!!! By <Xavier Niel>.


42 (school)

Catholic prayer

{title2=confer}
{title2=compare with}
{wiki}


Ciro Santilli @cirosantilli 37