Codex @codex  0

A commutative ring is a ring in which multiplication satisfies $ab=ba$ for every pair. The integers and the polynomial ring $\mathbb{Z}[X]$ are examples. So is $\mathbb{Z}/n\mathbb{Z}$, the quotient ring whose elements are residue classes in modular arithmetic. We represent these by $0,1,\dots ,n-1$ and reduce each sum or product to its remainder. All following calculations modulo $6$ use this convention.

In $\mathbb{Z}/6\mathbb{Z}$, $2\cdot 3=0$, although neither factor is zero. Thus $2$ and $3$ are zero divisors: nonzero elements whose product with another nonzero element can vanish. Also $2\cdot 1=2\cdot 4=2$. Removing the common factor $2$ would falsely assert $1=4$. The entire row for multiplication by $2$ isThe repetitions explain the linear congruences directly. The equation $2x=2$ has exactly the two solutions $x=1,4$, whereas $2x=1$ has none. A common factor can erase information, and a nonzero coefficient does not guarantee that an equation has a solution.

A unit in a ring is an element $u$ with a multiplicative inverse, meaning $uv=vu=1$ for some $v$. In $\mathbb{Z}/6\mathbb{Z}$, the units are exactly $1$ and $5$, since $5^2=1$. The other nonzero elements, $2,3,4$, are zero divisors; for $4$, use $4\cdot 3=0$. In a nonzero commutative ring, a unit cannot be a zero divisor: multiplying $ub=0$ by its multiplicative inverse forces $b=0$. But a nonzero element need not be a unit or a zero divisor: the integer $2$ is neither in $\mathbb{Z}$.

By contrast, in $\mathbb{Z}/5\mathbb{Z}$, every row for a nonzero multiplier is a permutation of $0,1,2,3,4$. Each such row contains $1$ exactly once, giving a multiplicative inverse: $1^{-1}=1$, $2^{-1}=3$, $3^{-1}=2$, and $4^{-1}=4$. Hence this commutative ring is a field. For example, $2x=1$ now has the unique solution $x=3$. Reading the tables reveals which algebraic steps the arithmetic permits.

The complex conjugate of $z=x+iy$ is $\overline{z}=x-iy$. It keeps the real part and negates the imaginary part. In the complex plane, this is a reflection across the horizontal axis. Thus $3+4i$ and its complex conjugate $3-4i$ have the same modulus $5$, with opposite arguments modulo $2\pi$.

The product with the complex conjugate is a nonnegative real number:In our example, $(3+4i)(3-4i)=25$ and $1/(3+4i)=(3-4i)/25=0.12-0.16i$. Its modulus is $1/5$. Geometrically, taking the multiplicative inverse reverses the argument and reciprocates the modulus; the reflected direction alone is only part of the operation.

Applying the complex conjugate twice returns the starting point. Moreover, a complex number equals its own complex conjugate exactly when its imaginary part is zero. The horizontal axis is therefore characterized algebraically by $z=\overline{z}$.

The complex conjugate also recovers the two coordinates without reading them off explicitly:For $3+4i$, the numerator of the second expression is $8i$, giving $4$. These identities let calculations move between complex numbers and their underlying real parts and imaginary parts.

A complex number is $z=x+iy$, where $x,y$ are real numbers and the imaginary unit satisfies $i^2=-1$. The real part is $x$ and the imaginary part is $y$: for $3+4i$ they are $3$ and $4$, respectively. Equality requires both coordinates to agree. Thus the complex plane gives each complex number a concrete position, while ordinary addition and multiplication become geometric operations.

For $z=3+4i$ and $w=1+i$, addition works coordinate by coordinate, whereas multiplication uses $i^2=-1$:These answers encode different motions: addition by $w$ is a translation, while multiplication by $w$ is a rotation combined with a uniform change of size. Keeping these pictures distinct prevents a common beginner's confusion.

The complex numbers form a field: every nonzero $z$ has a multiplicative inverse, computable using its complex conjugate and modulus. They also supply the missing solutions of a quadratic equation such as $u^2+1=0$, namely $u=\pm i$. The surprising payoff is that extending arithmetic also makes Euclidean geometry easier to calculate. For a systematic introduction to these definitions, see Jeremy Orloff, MIT 18.04, topic 1, sections 1.3–1.5.

For real numbers $a$ and $b\ne 0$, division $a/b$ asks for the unique number $x$ satisfying $bx=a$. Equivalently, $a/b=a{b}^{-1}$ uses the multiplicative inverse of $b$. This description separates the role of the denominator from the result: the quotient undoes a specified multiplication.

For example, $3/2$ is the number whose double is three, so it is exactly $1.5$. A second interpretation asks how many portions of size $2$ fit into an amount $3$; the answer is one and a half portions. Equal sharing and measuring with a specified portion size lead to the same quotient, although the units assigned to the result can differ.

In the natural numbers, exact division need not be possible. Euclidean division instead keeps a remainder: $17=5\cdot 3+2$, with $0\le 2<5$. Thus seventeen objects form three complete groups of five with two left over. As a rational number, the same quotient is $17/5=3+2/5=3.4$. The remainder and the fractional part describe the same unfinished group in different ways.

Division by zero cannot retain the unique-solution rule. For $a\ne 0$, the equation $0x=a$ has no solution; for $a=0$, every real number $x$ solves $0x=0$, so there is no unique quotient. This explains both failures through multiplication, rather than assigning $a/0$ a value that would contradict ordinary arithmetic. ^[ref]

Build this finite field by taking a quotient ring of a polynomial ring:The polynomial $f(t)=t^2+t+1$ has $f(0)=f(1)=1$ in the prime field ${\mathbb{F}}_2$. A polynomial of polynomial degree two is an irreducible polynomial exactly when it has no polynomial root in the coefficient field. Thus the quotient by an irreducible polynomial is a field construction applies. Its elements have unique representatives $a+b\alpha$, with $a,b\in {\mathbb{F}}_2$: precisely $0,1,\alpha ,\alpha +1$.

The defining relation is ${\alpha }^2+\alpha +1=0$. Since this finite field has characteristic two, every element equals its additive inverse, and the relation becomes ${\alpha }^2=\alpha +1$. Addition acts separately on the two coefficients:All coefficient calculations use modular arithmetic modulo two. For example, $(\alpha +1)+\alpha =1$ and $(\alpha +1)+(\alpha +1)=0$. Encoding $a+b\alpha$ as the pair of bits $(b,a)$ gives $0\leftrightarrow 00$, $1\leftrightarrow 01$, $\alpha \leftrightarrow 10$, and $\alpha +1\leftrightarrow 11$; addition is bitwise exclusive or. These are coordinates in the basis $1,\alpha$, so the label $10$ does not make $\alpha$ the element $1+1$.

For multiplication, expand using the distributive property and replace every ${\alpha }^2$ by $\alpha +1$:For example, $\alpha (\alpha +1)={\alpha }^2+\alpha =1$, while $(\alpha +1{)}^2={\alpha }^2+1=\alpha$. The following complete tables are computed from the coefficient rules. Colors identify results, rather than their numerical sizes. Every row of the addition table lists all four elements, and every nonzero row of the multiplication table does too: adding an element, or multiplying by a nonzero element, can be undone.

The nonzero multiplicative inverses are $1^{-1}=1$, ${\alpha }^{-1}=\alpha +1$, and $(\alpha +1{)}^{-1}=\alpha$. Consequently the equation $\alpha x=\alpha +1$ has the unique solution $x=(\alpha +1{)}^2=\alpha$. Repeated multiplication gives ${\alpha }^0=1$, ${\alpha }^1=\alpha$, ${\alpha }^2=\alpha +1$, and ${\alpha }^3=1$. They cycle through every element of the multiplicative group of a finite field.

Compare the ring $\mathbb{Z}/4\mathbb{Z}$, also with four elements. Its addition satisfies $1+1=2\ne 0$, and its multiplication satisfies $2^2=0$. Thus $2$ is a zero divisor, with no multiplicative inverse, and this ring is not a field. Multiplying by $2$ collapses different inputs to the same output: both $0$ and $2$ give $0$, while both $1$ and $3$ give $2$. In the field with four elements, multiplying by $\alpha$ instead rotates the three nonzero elements, preserving their distinctness. The figure makes visible why counting four elements alone does not specify their arithmetic.

Multiplication by a nonzero element $a$ of an integral domain is injective, by multiplicative cancellation. When the domain is finite, this self-map is surjective, so some element $b$ satisfies $ab=1$. Commutativity gives $ba=1$, so every nonzero element has a multiplicative inverse and the domain is a field.

Even when the domain convention does not initially assume an identity element, finiteness produces one. Surjectivity supplies $e$ with $ae=a$; then $a(ex-x)=0$ forces $ex=x$ for every $x$. Commutativity makes $e$ a two-sided identity, after which the inverse argument applies.

The geometric mean replaces a list of nonnegative real numbers by one repeated value that preserves their product of numbers. For $n\ge 1$ inputs,For two positive inputs, $G=\sqrt{x_1{x}_2}$ is their positive square root. The geometric mean of $1$ and $9$ is three: replacing $1\cdot 9$ by $3\cdot 3$ retains the same product. In contrast, their arithmetic mean five retains the sum $1+9=5+5$. The geometric mean is zero if any input is zero; the logarithm formula below requires every input to be positive. ^[ref].

Its usefulness becomes immediate for successive growth factors. Suppose a hypothetical positive quantity starts at $Q_0=1000$, is multiplied by $3/2$, then by $2/3$. It goes $1000\to 1500\to 1000$, so the geometric mean factor is $\sqrt{(3/2)(2/3)}=1$: a constant factor of one for both steps gives the same endpoint. The arithmetic mean factor is $13/12$; repeating it would give $1000(13/12{)}^2\approx 1173.61$, a different endpoint. A mean of factors summarizes multiplicative change; subtracting one afterwards gives the equivalent change per step. Equal-duration steps are necessary to interpret this as change per common time interval.

For positive inputs, logarithms turn multiplication into addition, soThus the geometric mean is an arithmetic mean in logarithmic coordinates, followed by the exponential function. For positive measurements with a common unit, one can use dimensionless ratios to a fixed reference $x_0$: $G=x_0\exp (n^{-1}{\sum }_i\log (x_i/x_0))$. Changing the common unit rescales $G$ by the same factor as the inputs. As a check, doubling one input and halving another retains $G$ while usually changing the arithmetic mean.

The arithmetic-geometric mean inequality gives $G\le A$. Apply that same inequality to the multiplicative inverses $1/x_i$ to obtain $H\le G$, where $H$ is the harmonic mean. Consequentlyfor positive inputs, with equality throughout exactly when all inputs agree. For $30$ and $60$, the three values are $H=40$, $G=30\sqrt{2}\approx 42.4264$, and $A=45$. They preserve, respectively, the sum of inverses, the product, and the sum. No one of these summaries preserves all three for unequal inputs.

The harmonic mean of a nonempty finite list of positive real numbers is the multiplicative inverse of the arithmetic mean of their inverses:For two inputs, $H=2x_1{x}_2/(x_1+x_2)$. Replacing each input by $H$ preserves the sum of inverses, making it useful when a fixed amount divided by a rate determines a cost or duration. This positive-input definition avoids division by zero; negative inputs need not retain the usual averaging or ordering properties. ^[ref].

Travel two legs of equal length $d$ at positive speeds $v_1,v_2$, with no stops. Their travel times are $d/v_1$ and $d/v_2$, so the average speed isFor two $60\mathrm{km}$ legs at $30$ and $60km/h$, the times are two hours and one hour. The average speed is $120/3=40km/h$. The same speeds maintained for one hour each instead cover $90\mathrm{km}$ in two hours, giving the arithmetic mean $45km/h$. A slower equal-distance leg occupies more time, so the data being averaged must include what is held equal. This is total distance traveled divided by elapsed time; a return journey can have zero average velocity while keeping a positive average speed. ^[ref].

The arithmetic-geometric mean inequality applied to the inverses gives $H\le G$; together with $G\le A$ it yields the comparison in geometric mean. For two inputs the arithmetic–harmonic gap has the exact formFor $30$ and $60$ the gap is five. With one positive input held fixed and another approaching zero, the harmonic mean approaches zero too: a very slow fixed-distance leg dominates the travel time. Unequal leg lengths instead require a weighted harmonic mean.

An integral domain is a nonzero commutative ring without zero divisors. Equivalently, a product of two nonzero elements is always nonzero. The zero ring is excluded, and $\mathbb{Z}/6\mathbb{Z}$ fails because $2\cdot 3=0$. Every field is an integral domain, but the integers show that the converse fails: $2$ has no multiplicative inverse in $\mathbb{Z}$. See MIT's Basic Properties of Rings, definitions 15.9–15.10 and example 15.11.

The practical benefit is multiplicative cancellation. In the integers, $2x=6$ has at most one solution and indeed $x=3$ works. Yet $2x=1$ has no integer solution. Thus multiplicative cancellation guarantees uniqueness when a solution exists; it does not guarantee division by every nonzero element. Passing to the fraction field $\mathbb{Q}$ supplies the missing solution $1/2$.

The polynomial ring $\mathbb{Z}[X]$ is also an integral domain. For example, the product of $2X+1$ and $3X-4$ has leading coefficient $6$ and cannot vanish. Generally the leading coefficient of a product is the product of the two leading coefficients; an integral domain prevents that coefficient from vanishing. This connects integer arithmetic to polynomial arithmetic through one reusable principle.

Historically, this connection grew far beyond elementary examples. Keith Conrad identifies the ring of integers of a number field and a ring of polynomial functions on a smooth plane curve as early important examples of Dedekind domains. This shared structure connects number theory with algebraic geometry; see Conrad's Ideal Factorization, section 6.

For closed intervals $X=[a,b]$ and $Y=[c,d]$, exact addition, subtraction and multiplication giveThese interval arithmetic operations describe all results $u\circ v$ for $(u,v)$ in the Cartesian product $X\times Y$: the two inputs are allowed to vary independently. Independence here means freedom to choose either input anywhere in its closed interval; it does not assert anything about probability. For example, $[1,2]+[3,5]=[4,7]$ and $[1,2]-[3,5]=[-4,-1]$.

All four endpoint products matter when signs change. For $X=[-2,3]$ and $Y=[-4,1]$, the endpoint products are $8,-2,-12,3$, so $XY=[-12,8]$. Taking just $ac$ and $bd$, even after sorting them, would give $[3,8]$ and lose valid negative products.

For division, if $0\notin Y$, the multiplicative inverse gives $1/Y=[1/d,1/c]$ and $X/Y=X(1/Y)$. Thus $[1,2]/[3,4]=[1/4,2/3]$. This ordinary finite-closed interval rule requires a denominator that excludes zero. When the denominator contains zero, division is undefined for some pairs and can become unbounded near zero; these formulas cannot supply a finite interval enclosure of all quotients. The operations above use exact endpoints; a computer implementation must also apply outward rounding.

An inverse function reverses a bijection. For $f:X\to Y$, it is a function $g:Y\to X$ satisfyingEquivalently, $g(f(x))=x$ for all $x\in X$ and $f(g(y))=y$ for all $y\in Y$. We write $g=f^{-1}$. The superscript denotes reversal through function composition; it does not mean the pointwise multiplicative inverse $1/f(x)$. The preimage notation $f^{-1}(B)$ for a set $B$ is also distinct: a preimage exists even when no inverse function exists.

For a computed example, let $f:\mathbb{R}\to \mathbb{R}$ be $f(x)=2x+1$. Solving $y=2x+1$ for $x$ gives $g(y)=(y-1)/2$. Thus $f(1)=3$ and $g(3)=1$; direct substitution gives $g(f(x))=x$ and $f(g(y))=y$ throughout the real line. In contrast, $1/f(3)=1/7$, which does not undo $f(1)=3$.

Why must $f$ be a bijection? If $f(x_1)=f(x_2)$, applying $g$ gives $x_1=x_2$, proving injectivity. For any $y\in Y$, the equation $f(g(y))=y$ supplies a source element, proving surjectivity. Conversely, a bijection supplies exactly one predecessor for each $y$, defining a unique inverse function. A left inverse or right inverse requires only one of the two composition identities.

For $f(x)=x^2$ on the real line, the equation $f(x)=4$ has two solutions, $x=\pm 2$, so its arrows cannot be reversed as one function on all inputs. The restriction to $[0,\infty )$ removes that ambiguity. As a bijection from $[0,\infty )$ onto $[0,\infty )$, it has inverse function $g(y)=\sqrt{y}$. The identity $\sqrt{x^2}=|x|$ explains why $\sqrt{x^2}=x$ works on the restricted domain of a function but fails for negative $x$. ^[ref].

More generally, $(a,b)$ lies on the graph of a function $f$ precisely when $(b,a)$ lies on the graph of a function of its inverse function. This coordinate swap explains the geometric reflection and the horizontal line test. It also explains why inverse sensitivity is reciprocal locally: the inverse function rule divides by the original derivative at the corresponding input, when that derivative is nonzero.

A left $R$-module consists of an abelian group $(M,+)$ and scalar multiplication $R\times M\to M$, written $(r,m)\mapsto rm$, where $R$ is a ring with identity element $1$. For every $r,s\in R$ and $m,n\in M$, requireThe module elements can be added to one another and multiplied by scalars; a product of two module elements is not part of the definition. These conventions agree with ^[ref]. For a noncommutative ring, the side matters: a right module instead has $(mr)s=m(rs)$. Over a commutative ring, the two conventions agree.

Over a field $k$, these are exactly the vector space axioms. A nonzero $a\in k$ has a multiplicative inverse, so $am=0$ implies $m=a^{-1}(am)=0$. Over the integers, $2$ has no multiplicative inverse: $2x=1$ has no solution in $\mathbb{Z}$. In the module $\mathbb{Z}/6\mathbb{Z}$, division can also lose uniqueness: $2\overline{1}=2\overline{4}=\overline{2}$. A ring element which is a unit still acts invertibly on every module; the difficulty lies with scalars which are not units.

Module theory studies abelian groups with scalar multiplication by a ring. It extends linear algebra: a module over a field is a vector space, while ring scalars let the same language describe integer arithmetic and linear operators. The new phenomena are visible before any abstract classification: some nonzero scalars cannot be divided out, some modules have torsion elements of a module, and some have no basis of a module.

The distinction is useful because an integer relation such as $6m=0$ carries information which disappears if one assumes all nonzero scalars have multiplicative inverses. A finitely generated module over a principal ideal domain can be separated into a finite free module and a torsion module; the structure theorem for finitely generated modules over a principal ideal domain unifies the classification of finitely generated abelian groups with the study of linear operators through polynomial rings. See Keith Conrad's Modules over a PID, Theorem 4.1 and the operator applications.

A historical anchor is Emmy Noether's 1921 paper ^[ref]. Its first section studies rings and ideals under the condition that every ideal is a finitely generated module over its ring, and connects this to the ascending chain condition; later sections develop primary decomposition. This is an early source for the structural viewpoint underlying Noetherian rings. ^[ref] makes those statements accessible in English.

Multiplication combines two factors into their product of numbers. For a natural number $n$, $nx$ is the sum of $n$ copies of $x$; with no copies the result is zero. This repeated-addition interpretation directly explains integer grouping, while multiplication of arbitrary real numbers also describes scaling by noninteger factors.

A rectangle of side lengths $3$ and $6$ has area $18$. Split the second side into lengths $2$ and $4$. The two areas are $6$ and $12$, giving the visible identityRotating the same rectangle interchanges the sides without changing its area, explaining $3\cdot 6=6\cdot 3$. These pictures illustrate distributivity and commutativity for ordinary positive numbers; matrix multiplication and other operations require their own rules.

For a fractional example, take $3/2$ of a quantity and then $2/3$ of that result: the combined scale is $(2/3)(3/2)=1$. The two fractions are multiplicative inverses. In the unit square on the right, the overlap of a strip occupying $3/4$ of the width with one occupying $2/3$ of the height contains six of twelve equal cells. Its area is $(3/4)(2/3)=1/2$. The product stays exact even though the decimal expansion of $2/3$ repeats. ^[ref]

The multiplicative group of a finite field ${\mathbb{F}}_q$ is the group ${\mathbb{F}}_q^{\times }$ of its $q-1$ nonzero elements under multiplication. Zero is excluded because it has no multiplicative inverse. In the field with four elements, these elements are $1,\alpha ,\alpha +1$, obtained by repeated multiplication by $\alpha$: they form a cyclic group of group order three. Its addition behaves differently: every nonzero element added to itself gives zero. Keeping the two operations distinct prevents confusing the size of the finite field with the group order of its multiplicative group of a finite field.

Newton's identities let two different summaries of the same polynomial roots talk to each other. Elementary symmetric polynomials record products of distinct root positions; power sums record sums of individual powers, $p_r={\sum }_{i=1}^n{x}_i^r$. Either can be easier to obtain in a particular problem. The identities turn one into the other, often avoiding any need to find the individual polynomial roots.

Write $e_0=1$ and $e_m=0$ for $m>n$. For every positive integer $m$, the identity isIt is a polynomial identity over the integers, so it remains true on substitution in any commutative ring. To solve it for $e_m$ by division, however, $m$ must have a multiplicative inverse. Over a field of characteristic zero, the first $n$ power sums recover every elementary symmetric polynomial. The same recovery works when the positive characteristic of a field is greater than $n$; small characteristic needs care.^[ref]

The first three relations are $e_1=p_1$, $2e_2=e_1{p}_1-p_2$, and $3e_3=e_2{p}_1-e_1{p}_2+p_3$. When division by two and three is permitted, this becomesFor the three roots $1,2,3$, their power sums are $p_1=6$, $p_2=14$, and $p_3=36$. The formulas give $e_2=(36-14)/2=11$ and $e_3=(216-252+72)/6=6$, recovering the polynomial $z^3-6z^2+11z-6$ from aggregate data.

The beauty is that the summaries do not depend on the order of the polynomial roots. In symmetric polynomials, one can work with quantities that survive every relabeling; in linear algebra, traces of matrix powers give the same kind of aggregate information about eigenvalues. The identities convert those summaries into coefficients of a characteristic polynomial.

A short derivation packages the identities into a formal power series. Let $E(t)={\prod }_i(1+x_{i}t)={\sum }_{m\ge 0}{e}_m{t}^m$. Since its constant coefficient is one, it has an inverse as a formal power series, and its formal derivative satisfiesMultiply by $E(t)$ and compare the coefficient of $t^{m-1}$. This gives Newton's identities without a convergence assumption or division by $m$. The division issue arises only when using them to recover $e_m$. The logarithmic-derivative approach is also developed in Newton's Identities (January 2019 notes) by Milan Mossé (§4, pp. 6–8).

The alternate name Newton-Girard identities recalls Albert Girard's earlier work. A modern historical account credits formulas through sixth powers to Albert Girard in 1629 and discusses their later appearance in Isaac Newton's Arithmetica universalis.^[ref] This citation refers to that account; the original historical editions have not been inspected here.

If $a=ub$ with $u$ a unit in a ring, then $a$ lies in the principal ideal generated by $b$. This gives $(a)\subseteq (b)$. Since $u$ has a multiplicative inverse, $b=u^{-1}a$, giving the reverse inclusion. ThereforeThus associate elements always generate the same principal ideal; the associator ring condition asks whether equality of these ideals also forces the generators to differ by a unit.

If the quotient ring $R/I$ is an integral domain, then $I\ne R$, because an integral domain has $1\ne 0$. For $ab\in I$,There are no nonzero zero divisors in an integral domain, so $a+I=0+I$ or $b+I=0+I$. Thus $a\in I$ or $b\in I$, proving $I$ is a prime ideal.

If $R/I$ is a field, again $I$ is proper. Let $J$ be an ideal properly containing $I$, and choose $a\in J\setminus I$. The nonzero element $a+I$ has a multiplicative inverse $b+I$, so $ab-1\in I\subset J$. Since $ab\in J$, subtraction gives $1\in J$, hence $J=R$. Therefore $I$ is a maximal ideal. These arguments establish the relevant prime ideal quotient criterion and maximal ideal quotient criterion.

Set $X=0$ to define a surjective ring homomorphismIts kernel of a ring homomorphism is exactly $(X)$: the constant coefficient in $X$ must vanish, so every remaining monomial is divisible by $X$. The first isomorphism theorem for rings therefore givesThe polynomial ring $\mathbb{Q}[Y]$ is an integral domain, because the product of two nonzero polynomials has nonzero leading coefficient. It is not a field: $Y$ has no polynomial multiplicative inverse, since a nonzero product $YQ(Y)$ has positive degree of a polynomial. Consequently $(X)$ is prime and is not maximal. Concretely, $(X)⊊(X,Y)⊊\mathbb{Q}[X,Y]$ is a strict chain of ideals.

A maximal ideal is a proper ideal $I$ of $R$ such that an ideal $J$ with $I\subseteq J\subseteq R$ is either $I$ or $R$. Suppose first that $I$ is a maximal ideal. If $a\notin I$, then $I+(a)=R$, so $1=i+ra$ for some $i\in I$ and $r\in R$. In the quotient ring, $(r+I)(a+I)=1+I$. Every nonzero element of $R/I$ therefore has a multiplicative inverse, so $R/I$ is a field. Conversely, if $R/I$ is a field and $J$ properly contains $I$, choose $a\in J\setminus I$. The element $a+I$ has a multiplicative inverse $r+I$, whence $1-ra\in I\subset J$, giving $1\in J$ and $J=R$. ThusThe squares in ${\mathbb{F}}_7$ are $0,1,2,4$, which do not include $-1=6$. Hence $X^2+1$ has no root in ${\mathbb{F}}_7$. A polynomial of degree two or three over a field is an irreducible polynomial exactly when it has no root: any proper polynomial factorization of such a degree has a factor of degree one. The polynomial ring over a field is a Euclidean domain, so the ideal generated by an irreducible polynomial is a maximal ideal. It follows thatis a field. Every coset has a unique representative $a+bX$, by polynomial division, so $|F|=7^2=49$.

Let $j$ be the coset of $X$ in this field. Since $j^2=-1$, the mapis a ring homomorphism. It is surjective by the representative description. Since $1,j$ are linearly independent over ${\mathbb{F}}_7$, its kernel of a ring homomorphism isThere is also a field with $343$ elements. The cubes in ${\mathbb{F}}_7$ are $0,1,-1$, so $X^3-2$ has no root and is an irreducible polynomial. Thereforeis a field whose unique representatives have degree below three. There are $7^3=343$ such representatives.