← 2026 Paper 2

UPSC 2026 Maths Optional Paper 2 Q4a — Step-by-Step Solution

15 marks · Section A

Integral domains; characteristic · Algebra · asked 3× in 14 yrs · Read the full method →

Question

Let nn be a positive integer. Show that the following statements are equivalent:

(i) Z/nZ\mathbb{Z}/n\mathbb{Z} is an integral domain.

(ii) Z/nZ\mathbb{Z}/n\mathbb{Z} is a field.

(iii) nn is prime.

Technique

Three statements, so six implications in principle — but a cycle (i)⇒(iii)⇒(ii)⇒(i)(\mathrm{i})\Rightarrow(\mathrm{iii})\Rightarrow(\mathrm{ii})\Rightarrow(\mathrm{i}) proves all six by transitivity and costs less than half the writing. Announce the cycle, then run it: the composite factorisation n=abn=ab manufactures the zero divisor, Bézout manufactures the inverse, and “field ⇒\Rightarrow domain” is the one-line generic implication. The whole question turns on one axiom most candidates never write down — an integral domain and a field are both required to satisfy 1≠01\neq 0 — because n=1n=1 is a live case here and is only excluded by that axiom.

Solution

Step 0 — Conventions, stated because the marks depend on them.

All rings below are commutative with identity. Recall the two definitions in the precise form:

The clause 1R≠0R1_R\neq 0_R (equivalently, RR is not the zero ring) is part of both definitions. It is the clause that does the work at n=1n=1; Step 6 is devoted to it.

An integer pp is prime if p≥2p\ge 2 and its only positive divisors are 11 and pp. In particular 11 is not prime, and no prime is 11.

Step 1 — The ring Z/nZ\mathbb{Z}/n\mathbb{Z}, and two facts we shall use repeatedly.

For n≥1n\ge 1, nZn\mathbb{Z} is an ideal of Z\mathbb{Z} and the quotient

Z/nZ={0ˉ,1ˉ,…,n−1‾},aˉ:=a+nZ,\mathbb{Z}/n\mathbb{Z}=\{\bar 0,\bar 1,\dots,\overline{n-1}\},\qquad \bar a:=a+n\mathbb{Z},

is a commutative ring with identity 1ˉ\bar 1 under aˉ+bˉ=a+b‾\bar a+\bar b=\overline{a+b}, aˉ bˉ=ab‾\bar a\,\bar b=\overline{ab} (these are well defined precisely because nZn\mathbb{Z} is an ideal). It has exactly nn elements.

Fact A. aˉ=0ˉ  ⟺  n∣a\bar a=\bar 0 \iff n\mid a. In particular, if 0<a<n0<a<n then aˉ≠0ˉ\bar a\neq\bar 0.

Fact B. 1ˉ=0ˉ  ⟺  n∣1  ⟺  n=1\bar 1=\bar 0\iff n\mid 1\iff n=1 (as n≥1n\ge 1). Hence

1ˉ≠0ˉ  in  Z/nZ  ⟺  n≥2.\bar 1\neq\bar 0\ \text{ in }\ \mathbb{Z}/n\mathbb{Z}\iff n\ge 2 .

Step 2 — Strategy: prove a cycle, not six implications.

The three statements are equivalent as soon as we prove the single cycle

(i)  ⟹  (iii)  ⟹  (ii)  ⟹  (i),(\mathrm{i})\;\Longrightarrow\;(\mathrm{iii})\;\Longrightarrow\;(\mathrm{ii})\;\Longrightarrow\;(\mathrm{i}),

because then any one of them implies any other by following the arrows round (e.g. (ii)⇒(iii)(\mathrm{ii})\Rightarrow(\mathrm{iii}) is (ii)⇒(i)⇒(iii)(\mathrm{ii})\Rightarrow(\mathrm{i})\Rightarrow(\mathrm{iii})). We prove exactly these three implications.

Step 3 — (i)⇒(iii)(\mathrm{i})\Rightarrow(\mathrm{iii}): if Z/nZ\mathbb{Z}/n\mathbb{Z} is an integral domain then nn is prime.

Assume Z/nZ\mathbb{Z}/n\mathbb{Z} is an integral domain.

First, n≥2n\ge 2. By the definition of an integral domain, 1ˉ≠0ˉ\bar 1\neq \bar 0; by Fact B this forces n≥2n\ge 2. (This is where n=1n=1 is killed. Do not skip it — see Step 6.)

Next, nn has no non-trivial factorisation. Suppose, for contradiction, that nn is not prime. Since n≥2n\ge2 and nn is not prime, nn has a positive divisor other than 11 and nn; so we may write

n=abwith1<a<n,1<b<n.n=ab\qquad\text{with}\qquad 1<a<n,\quad 1<b<n .

By Fact A, 0<a<n0<a<n gives aˉ≠0ˉ\bar a\neq\bar 0 and 0<b<n0<b<n gives bˉ≠0ˉ\bar b\neq\bar 0. But

aˉ bˉ=ab‾=nˉ=0ˉ,\bar a\,\bar b=\overline{ab}=\bar n=\bar 0 ,

so aˉ\bar a and bˉ\bar b are zero divisors in Z/nZ\mathbb{Z}/n\mathbb{Z} — contradicting the hypothesis that it is an integral domain.

Hence nn is prime. ■\qquad\blacksquare

Step 4 — (iii)⇒(ii)(\mathrm{iii})\Rightarrow(\mathrm{ii}): if nn is prime then Z/nZ\mathbb{Z}/n\mathbb{Z} is a field.

Let n=pn=p be prime, so p≥2p\ge2.

The ring is non-trivial and commutative with identity. By Step 1 it is commutative with identity 1ˉ\bar1, and by Fact B, p≥2p\ge2 gives 1ˉ≠0ˉ\bar 1\neq\bar 0.

Every non-zero element is invertible. Let aˉ≠0ˉ\bar a\neq\bar 0, i.e. (Fact A) p∤ap\nmid a. Consider d=gcd⁡(a,p)d=\gcd(a,p). Since d∣pd\mid p and pp is prime, d=1d=1 or d=pd=p; and d=pd=p would give p∣ap\mid a, which is false. Hence

gcd⁡(a,p)=1.\gcd(a,p)=1 .

By Bézout’s identity there exist integers u,vu,v with

au+pv=1.au+pv=1 .

Reducing modulo pp (i.e. applying the ring homomorphism Z→Z/pZ\mathbb{Z}\to\mathbb{Z}/p\mathbb{Z}, and using pˉ=0ˉ\bar p=\bar 0):

aˉ uˉ+0ˉ⋅vˉ=1ˉ⟹aˉ uˉ=1ˉ.\bar a\,\bar u+\bar 0\cdot\bar v=\bar 1\quad\Longrightarrow\quad \bar a\,\bar u=\bar 1 .

So uˉ\bar u is a multiplicative inverse of aˉ\bar a. As aˉ≠0ˉ\bar a\neq\bar0 was arbitrary, every non-zero element of Z/pZ\mathbb{Z}/p\mathbb{Z} is a unit.

Therefore Z/pZ\mathbb{Z}/p\mathbb{Z} is a field. ■\qquad\blacksquare

(Bézout is the route to write, because it is constructive — it names the inverse uˉ\bar u. An alternative, equally valid, is the pigeonhole argument: for aˉ≠0ˉ\bar a\neq \bar 0 the map φ:Z/pZ→Z/pZ\varphi:\mathbb{Z}/p\mathbb{Z}\to\mathbb{Z}/p\mathbb{Z}, φ(xˉ)=aˉxˉ\varphi(\bar x)=\bar a\bar x, is injective — aˉxˉ=aˉyˉ⇒p∣a(x−y)⇒p∣x−y\bar a\bar x=\bar a\bar y\Rightarrow p\mid a(x-y)\Rightarrow p\mid x-y by Euclid’s lemma — hence surjective on the finite set Z/pZ\mathbb{Z}/p\mathbb{Z}, so 1ˉ\bar 1 is attained.)

Step 5 — (ii)⇒(i)(\mathrm{ii})\Rightarrow(\mathrm{i}): every field is an integral domain.

This implication uses nothing about Z/nZ\mathbb{Z}/n\mathbb{Z}; it is the general fact.

Let FF be a field. By definition FF is commutative with 1≠01\neq 0, so only the absence of zero divisors needs checking. Suppose ab=0ab=0 in FF with a≠0a\neq 0. Since FF is a field, a−1a^{-1} exists, and

b=1⋅b=(a−1a)b=a−1(ab)=a−1⋅0=0.b=1\cdot b=(a^{-1}a)b=a^{-1}(ab)=a^{-1}\cdot 0=0 .

So ab=0ab=0 forces a=0a=0 or b=0b=0: FF has no zero divisors, and FF is an integral domain.

Applying this with F=Z/nZF=\mathbb{Z}/n\mathbb{Z} closes the cycle. ■\qquad\blacksquare

Step 6 — The case n=1n=1, addressed explicitly (this is where the question bites).

The hypothesis is that nn is a positive integer, so n=1n=1 is admitted and must be dealt with. Here

Z/1Z={0ˉ}is the zero ring, and1ˉ=0ˉ.\mathbb{Z}/1\mathbb{Z}=\{\bar 0\}\quad\text{is the zero ring, and}\quad \bar 1=\bar 0 .

Now note carefully:

Hence at n=1n=1 all three statements (i), (ii), (iii) are false, so they are (trivially but genuinely) equivalent there. The general argument of Steps 3–5 already covers this: the only place n=1n=1 could have leaked through is Step 3, and it was excluded there by the 1ˉ≠0ˉ\bar1\neq\bar0 axiom, which is exactly why that half-line was written out.

Step 7 — Conclusion.

The cycle (i)⇒(iii)⇒(ii)⇒(i)(\mathrm{i})\Rightarrow(\mathrm{iii})\Rightarrow(\mathrm{ii})\Rightarrow(\mathrm{i}) is established for every positive integer nn, hence

Z/nZ is an integral domain  ⟺  Z/nZ is a field  ⟺  n is prime.■\mathbb{Z}/n\mathbb{Z}\ \text{is an integral domain}\iff \mathbb{Z}/n\mathbb{Z}\ \text{is a field}\iff n\ \text{is prime}.\qquad\blacksquare

Step 8 — Two remarks that show the structure behind the result.

(a) The ideal-theoretic proof (one line each). For a commutative ring RR with identity and an ideal II:

R/I is an integral domain  ⟺  I is prime;R/I is a field  ⟺  I is maximal.R/I\ \text{is an integral domain}\iff I\ \text{is prime};\qquad R/I\ \text{is a field}\iff I\ \text{is maximal}.

In R=ZR=\mathbb{Z} the ideals are exactly nZn\mathbb{Z}, n≥0n\ge0, and for n≥1n\ge1

nZ prime  ⟺  n prime  ⟺  nZ maximal,n\mathbb{Z}\ \text{prime}\iff n\ \text{prime}\iff n\mathbb{Z}\ \text{maximal},

the middle-to-right step being the standard fact that in a PID every non-zero prime ideal is maximal. Substituting I=nZI=n\mathbb{Z} gives (i)   ⟺  \iff (iii)   ⟺  \iff (ii) at once. The elementary proof above is still the one to present — it needs no quotient-ring machinery — but quoting this in two lines at the end is cheap and reads as mastery.

(b) Why the hypothesis ”nn positive” is not decoration. The ring Z/0Z≅Z\mathbb{Z}/0\mathbb{Z}\cong\mathbb{Z} is an integral domain but is not a field, and 00 is not prime. So at n=0n=0 statement (i) is true while (ii) and (iii) are false: the three statements are not equivalent. The restriction n≥1n\ge1 in the question is doing real work. (In the ideal language: {0}\{0\} is a prime ideal of Z\mathbb{Z} that is not maximal — the single exception in the PID fact quoted in (a).)

(c) The trichotomy behind (i) ⇒\Rightarrow (ii). For n≥2n\ge2, aˉ\bar a is a unit of Z/nZ\mathbb{Z}/n\mathbb{Z} iff gcd⁡(a,n)=1\gcd(a,n)=1, and a non-zero aˉ\bar a is a zero divisor iff gcd⁡(a,n)>1\gcd(a,n)>1; so in Z/nZ\mathbb{Z}/n\mathbb{Z} every non-zero element is either a unit or a zero divisor, with no third possibility. This is the concrete face of the general theorem every finite integral domain is a field, which supplies (i)⇒(ii)(\mathrm{i})\Rightarrow(\mathrm{ii}) directly if one prefers.

Answer

  For every positive integer n:Z/nZ integral domain  ⟺  Z/nZ field  ⟺  n prime,proved by the cycle (i)⇒(iii)⇒(ii)⇒(i):n=ab, 1<a,b<n ⇒ aˉbˉ=0ˉ with aˉ,bˉ≠0ˉ;gcd⁡(a,p)=1⇒au+pv=1⇒aˉ−1=uˉ;ab=0, a≠0 ⇒ b=a−1(ab)=0.Edge case n=1: Z/1Z={0ˉ} has 1ˉ=0ˉ, so it is neither a domain nor a field, and 1 is not prime— all three statements false, equivalence intact. (At n=0 it would fail: Z is a domain, not a field.)  \boxed{\; \begin{aligned} &\text{For every positive integer } n:\quad \mathbb{Z}/n\mathbb{Z}\ \text{integral domain}\iff \mathbb{Z}/n\mathbb{Z}\ \text{field}\iff n\ \text{prime},\\[2pt] &\text{proved by the cycle } (\mathrm{i})\Rightarrow(\mathrm{iii})\Rightarrow(\mathrm{ii})\Rightarrow(\mathrm{i}):\\[2pt] &\quad n=ab,\ 1<a,b<n\ \Rightarrow\ \bar a\bar b=\bar0\ \text{with}\ \bar a,\bar b\neq\bar0;\qquad \gcd(a,p)=1\Rightarrow au+pv=1\Rightarrow \bar a^{-1}=\bar u;\\[2pt] &\quad ab=0,\ a\neq0\ \Rightarrow\ b=a^{-1}(ab)=0 .\\[4pt] &\textbf{Edge case } n=1:\ \mathbb{Z}/1\mathbb{Z}=\{\bar0\}\ \text{has } \bar1=\bar0,\ \text{so it is neither a domain nor a field, and }1\text{ is not prime}\\ &\text{— all three statements false, equivalence intact. (At } n=0\text{ it would fail: } \mathbb{Z}\ \text{is a domain, not a field.)} \end{aligned}\;}
We post more of this — worked solutions, CSAT trap breakdowns, guide chapters — a few times a week on Telegram. Free, no sign-in. Join

This solution is part of the Maths Coverage Map — 14 years, mapped. Get the take-away PDF free.