You open a number theory problem and the first line is "let n be a positive integer." You shrug and carry on. But the wording is doing real work — if the author had written "let n be an integer" instead, the rest of the problem would often become ill-defined, the theorems would lose their clean form, and the answer might not exist. This article walks through exactly what would break.

Two separate things can go wrong when you loosen "positive integer" to "any integer": zero causes divisibility to misbehave, and negative numbers cause factorisation to stop being unique. Both are serious. Both are why the qualifier is there.

What "positive integer" cuts out

The integers are \mathbb{Z} = \{\ldots, -3, -2, -1, 0, 1, 2, 3, \ldots\}. The positive integers are \mathbb{Z}_{> 0} = \{1, 2, 3, \ldots\}. By saying "positive integer," the problem is ruling out two specific sources of trouble:

  1. Zero. 0 is an integer but is not positive.
  2. Negative integers. -1, -2, \ldots are integers but are not positive.

Each causes a different kind of breakdown.

Problem 1: Zero destroys divisibility statements

Recall the definition: a \mid b means there is an integer k with b = ak. Now let us see what happens for a = 0.

0 \mid b \iff \text{there is } k \text{ with } b = 0 \cdot k = 0.

So 0 \mid b is true only when b = 0, and false otherwise. In particular, 0 \mid 0 is true (take k = 1, or k = 7, or any k you like). This is already strange — every integer k "works."

Worse, consider "what are the divisors of 0?" Every integer n \neq 0 divides 0, because 0 = n \cdot 0. So 0 has infinitely many divisors. Standard results like "\gcd(a, b) \leq \min(a, b)" collapse when 0 is allowed, because \gcd(0, 0) is not even well defined (what is the "largest" common divisor when every integer divides both?).

What happens to familiar number-theory facts when zero is allowedA slider scans four scenarios. Scenario 0: gcd of 12 and 18 equals 6, a unique positive integer, works normally. Scenario 1: gcd of 12 and 0 equals 12, still defined, since every integer divides zero. Scenario 2: gcd of 0 and 0 is undefined — no largest common divisor because every integer is a common divisor. Scenario 3: the divisor count of zero is infinite, breaking any statement that counts divisors.
Slide through four scenarios and watch standard number-theory statements degrade as zero enters the picture. The GCD of two positive integers is always a clean positive integer. Once either input is zero, edge-case gymnastics start. Once both are zero, the concept breaks.

Also: the LCM of a and 0 is 0 (since 0 is a multiple of every integer). If you try the identity \gcd(a, b) \cdot \operatorname{lcm}(a, b) = a \cdot b with b = 0, you get a \cdot 0 = 0 on the right, which matches \gcd(a, 0) \cdot 0 = 0 on the left — but the identity becomes the trivial 0 = 0 and carries no information. Useful arithmetic on both sides vanishes.

Every standard divisibility theorem excludes 0 precisely to avoid these malfunctions.

Problem 2: Negatives destroy uniqueness of factorisation

Now try allowing negatives. Consider the Fundamental Theorem of Arithmetic: every integer \geq 2 factors uniquely into primes.

Can this extend to negative integers? Take -12. You might write:

-12 = -1 \cdot 2^2 \cdot 3 = (-2) \cdot 2 \cdot 3 = 2 \cdot (-2) \cdot 3 = (-2) \cdot (-2) \cdot (-3).

All of these equal -12. Which one is "the" factorisation? The primes are no longer uniquely determined — you can flip signs of any even number of factors and still hit the same product. Uniqueness is gone.

The standard fix is: when you extend number theory to the integers \mathbb{Z}, you define primes up to sign, and you separate out the units \pm 1. You then say "every non-zero integer factors into primes, uniquely up to order and up to multiplication by units (\pm 1)." That statement is correct, but it is uglier and takes more words.

For a school syllabus, the cleaner move is to restrict to positive integers from the start. One sign, one unit (1), one factorisation per number. That is what the phrase "positive integer" buys.

Problem 3: The GCD of negatives is ambiguous without convention

What is \gcd(-12, 18)? The common positive divisors of -12 and 18 are 1, 2, 3, 6 (same as for 12 and 18, since divisors don't care about sign). So we say \gcd(-12, 18) = 6.

But what about \gcd(12, 18) = 6 vs \gcd(12, 18) = -6? The number -6 is also a common divisor (every d that divides both 12 and 18 has a partner -d that also divides both). If you took "greatest" in the sense of magnitude, you would get 6. If you took it in the sense of "farthest along the number line in the positive direction," you would also get 6. Both conventions agree for positive inputs. For negative inputs, you need the additional rule "the GCD is always taken to be non-negative."

Again — this is a convention that costs only a footnote in the definition, but the convention is necessary. Restricting to positive integers makes the convention unnecessary, because "greatest" is unambiguous on positive divisors of positive numbers.

Problem 4: Primality loses its meaning for negatives

If you allow -5 to be called "prime" (same divisors as 5, just negated), then 5 and -5 are both primes. And 5 = (-1) \cdot (-5) is a "factorisation" of 5 into two "primes." The definition of a prime — a number with no non-trivial factorisation — has to be rewritten to exclude trivial factorisations that use units.

This is exactly what mathematicians do in ring theory, a university-level subject where the units and primes of each number system are studied rigorously. For a school introduction, "positive integer p > 1" short-circuits all that machinery.

How the rules degrade: a summary table

Property Positive integers With zero With negatives
Divisibility a \mid b Clean relation 0 \mid 0 is strange; 0 has infinite divisors Double-counts (both d and -d divide)
\gcd(a, b) Well-defined positive integer \gcd(0, 0) undefined Needs convention "non-negative"
\operatorname{lcm}(a, b) Well-defined positive integer Becomes 0 whenever an input is 0 Needs sign convention
Prime factorisation Unique 0 has none Unique only up to \pm 1 (units)
Number of divisors Finite 0 has infinitely many Doubles (each d and -d)

Every row in this table has more content (and more caveats) the further right you read. "Positive integer" is the setting where everything is clean.

Why it still matters even when the extension is harmless

Some problems do generalise cleanly to all non-zero integers. For those, the restriction to positives is a matter of convention and readability, not necessity. But even then, writing "positive integer" in the hypothesis means:

Indian competitive exams (JEE, RMO, INMO) rely heavily on induction and pattern-matching arguments. Those arguments are built for \mathbb{Z}_{> 0}. The problem statements reflect that.

An exam-room test you can apply

Before you solve a number theory problem, ask:

  1. Does my argument use b = ak with a dividing b? If yes, my argument silently assumes a \neq 0.
  2. Does my argument use uniqueness of prime factorisation? If yes, my argument assumes the inputs are positive (or I need to track signs explicitly).
  3. Am I taking the "largest" divisor or "smallest" multiple? If yes, I'm assuming an ordering — which positive integers have but signed integers need a convention for.

If any of these apply, and the problem says "positive integer," the restriction is pulling real weight. If you tried to reuse your argument for arbitrary integers, you would have to patch each of those places.

One-line takeaway

"Positive integer" is not padding. It is the domain where divisibility is a clean relation, factorisation is unique, and GCD/LCM are well defined. Allow zero and divisibility breaks. Allow negatives and uniqueness breaks. The restriction is what lets the theorems be stated cleanly — drop it, and the theorems need repair.

Related: Number Theory Basics · Why is 1 Not a Prime Number? · Does gcd × lcm = product Work for Three Numbers? · Number Systems · Modular Arithmetic