ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

$360 = 2^{3} \cdot 3^{2} \cdot 5$ and $84 = 2^{2} \cdot 3 \cdot 7$ , with $\gcd (360, 84) = 12$ and $lcm (360, 84) = 2520$ read off the exponents

Example

Powers are the natural powers of Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ in the commutative monoid $(Z, \cdot, 1)$ of $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ . For $k \in N$ the symbol $k$ inside $Z$ means $ι (k)$ , the embedding of The naturals embed in the integers.

$360 = 2^{3} \cdot 3^{2} \cdot 5, 84 = 2^{2} \cdot 3 \cdot 7.$

Reading these against the injective list of primes $p = (2, 3, 5, 7)$ , which contains every prime divisor of both numbers, For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list identifies the exponents as valuations (The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ ):

$p$	$2$	$3$	$5$	$7$
$v_{p} (360)$	$3$	$2$	$1$	$0$
$v_{p} (84)$	$2$	$1$	$0$	$1$
$\min$	$2$	$1$	$0$	$0$
$\max$	$3$	$2$	$1$	$1$

By For positive integers $a$ and $b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; so the exponent-wise greatest common divisor is the $\gcd$ of the divisibility page and not a second notion the minimum row is the valuation vector of $\gcd (360, 84)$ and the maximum row that of $lcm (360, 84)$ , so

$\gcd (360, 84) = 2^{2} \cdot 3 = 12, lcm (360, 84) = 2^{3} \cdot 3^{2} \cdot 5 \cdot 7 = 2520.$

Two independent checks are carried out below: the Euclidean algorithm of The Euclidean algorithm: for $a \in Z$ and $b > 0$ the remainder descent from $(a, b)$ terminates, and the last nonzero remainder is $\gcd (a, b)$ returns $12$ from the descent $360 = 4 \cdot 84 + 24$ , $84 = 3 \cdot 24 + 12$ , $24 = 2 \cdot 12 + 0$ ; and $12 \cdot 2520 = 30240 = 360 \cdot 84$ , as Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ , and $\gcd (a, b) \cdot lcm (a, b) = ∣ a b ∣$ requires.

Facts & Assumptions

Given: The integers $360$ , $84$ , $12$ and $2520$ , and the primes $2$ , $3$ , $5$ , $7$ .

[L1]

$Z$ is a commutative ring: multiplication is associative and commutative, $x \cdot 1 = x$ , and multiplication distributes over addition (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals); its order is total, antisymmetric and transitive (The integers form a totally ordered ring, Order on the integers, The naturals embed in the integers).

[L2]

$g^{0} = 1$ and $g^{σ (k)} = g^{k} g$ in $(Z, \cdot, 1)$ ; and $g^{m + n} = g^{m} g^{n}$ (Powers $g^{n}$ : natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$ , Exponent laws in a group: $g^{m + n} = g^{m} g^{n}$ and $(g^{m})^{n} = g^{m n}$ for all $m, n \in Z$ , and $(g h)^{n} = g^{n} h^{n}$ when $g$ and $h$ commute, Semigroup and monoid, $(Z, \cdot, 1)$ is a commutative monoid whose group of units is ${1, - 1}$ ; equivalently $u ∣ 1$ holds exactly for $u = 1$ and $u = - 1$ , The product $g_{0} g_{1} \dots g_{n - 1}$ of a finite list in a monoid, by recursion, with the empty product ( $n = 0$ ) equal to the identity).

[L3]

For $n \geq 1$ and an injective list $p$ of primes containing every prime divisor of $n$ : $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ , the exponents are determined by $n$ , and $v_{q} (n) = 0$ for a prime $q$ off the list (For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list, The fundamental theorem of arithmetic: every integer $n \geq 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i < r} p_{i} = \prod_{j < s} q_{j}$ with every $p_{i}$ and $q_{j}$ prime, then $r = s$ and $q_{i} = p_{π (i)}$ for some $π \in Sym (r)$ , Every integer $n \geq 1$ is a finite product of primes: there are $r \in N$ and a list $p : r \to Z$ of primes with $n = \prod_{i < r} p_{i}$ , the case $n = 1$ being the empty product, The $p$ -adic valuation $v_{p} (a)$ of a nonzero integer: the greatest $k \in N$ with $p^{k} ∣ a$ , For a prime $p$ and a nonzero integer $a$ : $p^{v_{p} (a)} ∣ a$ and $p^{v_{p} (a) + 1} ∤ a$ ; $p^{k} ∣ a$ holds exactly for $k \leq v_{p} (a)$ ; $v_{p} (a) \geq 1$ exactly when $p ∣ a$ ; $v_{p} (1) = v_{p} (- 1) = 0$ ; and $v_{p} (p) = 1$ , $v_{p} (a b) = v_{p} (a) + v_{p} (b)$ for nonzero integers $a, b$ , and $v_{p} (a + b) \geq \min {v_{p} (a), v_{p} (b)}$ whenever $a$ , $b$ and $a + b$ are all nonzero).

[L4]

For positive $a, b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; and a positive integer with those valuations is the $\gcd$ , respectively the $lcm$ (For positive integers $a$ and $b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; so the exponent-wise greatest common divisor is the $\gcd$ of the divisibility page and not a second notion, Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ , Common multiple, and the least common multiple $lcm (a, b)$ , taken to be $0$ when $a = 0$ or $b = 0$ , Every common divisor of $a$ and $b$ divides $\gcd (a, b)$ ; consequently $d = \gcd (a, b)$ exactly when $d \geq 0$ , $d ∣ a$ , $d ∣ b$ , and every common divisor of $a$ and $b$ divides $d$ — a characterisation that holds at $(a, b) = (0, 0)$ as well).

[L5]

For $a \in Z$ and $b > 0$ there is exactly one pair $(q, r)$ with $a = q b + r$ and $0 \leq r < b$ , and $b ∣ a$ exactly when $r = 0$ (Division with remainder in $Z$ : for $a \in Z$ and $b > 0$ there are unique $q, r \in Z$ with $a = q b + r$ and $0 \leq r < b$ , Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ , Divisibility is reflexive and transitive on $Z$ , and is linear: if $d ∣ a$ and $d ∣ b$ then $d ∣ a x + b y$ for all integers $x, y$ ; also $d ∣ a$ implies $d ∣ a c$ , $- d ∣ a$ and $d ∣ - a$ ).

[L6]

The remainder descent from $(a, b)$ with $b > 0$ terminates and its last nonzero remainder is $\gcd (a, b)$ (The Euclidean algorithm: for $a \in Z$ and $b > 0$ the remainder descent from $(a, b)$ terminates, and the last nonzero remainder is $\gcd (a, b)$ ).

[L7]

$\gcd (a, b) lcm (a, b) = ∣ a b ∣$ (Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ , and $\gcd (a, b) \cdot lcm (a, b) = ∣ a b ∣$ ).

[L9]

If $q$ is prime and $q ∣ u v$ then $q ∣ u$ or $q ∣ v$ (Euclid's lemma: if $p$ is prime and $p ∣ a b$ then $p ∣ a$ or $p ∣ b$ ).

[L8]

An integer $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ (Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$ ); and a divisor $d$ of a nonzero $a$ satisfies $∣ d ∣ \leq ∣ a ∣$ (If $d ∣ a$ and $a \neq 0$ then $d \neq 0$ and $∣ d ∣ \leq ∣ a ∣$ ; hence the set of divisors of a nonzero integer is bounded above by $∣ a ∣$ ).

Verification

technique · direct

1.1

The two products are correct: $2^{3} = 8$ , $3^{2} = 9$ , and $8 \cdot 9 = 72$ with $72 \cdot 5 = 360$ ; likewise $2^{2} = 4$ , $4 \cdot 3 = 12$ and $12 \cdot 7 = 84$ .

L1L2algebra

1.2

$2$ , $3$ , $5$ and $7$ are prime, and they are pairwise distinct. Each exceeds $1$ ; and a positive divisor $d$ of such a number $a$ satisfies $1 \leq d \leq a$ by [L8], so the candidates are the finitely many integers in that range, and each is settled by its remainder under [L5]: $2 = 1 \cdot 2 + 0$ has only $1$ and $2$ as candidates; for $3$ the extra candidate $2$ gives $3 = 1 \cdot 2 + 1$ ; for $5$ the extra candidates $2, 3, 4$ give remainders $1$ , $2$ , $1$ ; and for $7$ the extra candidates $2, 3, 4, 5, 6$ give remainders $1$ , $1$ , $3$ , $2$ , $1$ . In each case no divisor other than $1$ and the number itself survives.

L1L5L8algebra

2.1

The list $p = (2, 3, 5, 7)$ is injective and consists of primes, and it contains every prime divisor of $360$ and of $84$ . Injectivity and primality are step 1.2. For the covering: if $q$ is prime and $q ∣ 360 = 2 \cdot 2 \cdot 2 \cdot 3 \cdot 3 \cdot 5$ , repeated use of [L9] gives $q ∣ 2$ , $q ∣ 3$ or $q ∣ 5$ , and $q$ being a positive divisor of a prime with $q > 1$ forces $q$ to be that prime; likewise $q ∣ 84 = 2 \cdot 2 \cdot 3 \cdot 7$ forces $q \in {2, 3, 7}$ .

step 1.1step 1.2L8L9

3.1

By [L3] applied to $360$ with this list, the exponents in step 1.1 are the valuations: $v_{2} (360) = 3$ , $v_{3} (360) = 2$ , $v_{5} (360) = 1$ , $v_{7} (360) = 0$ .

step 1.1step 2.1L3

3.2

By [L3] applied to $84$ : $v_{2} (84) = 2$ , $v_{3} (84) = 1$ , $v_{5} (84) = 0$ , $v_{7} (84) = 1$ .

step 1.1step 2.1L3

4.1

Taking minima entrywise gives $2, 1, 0, 0$ , and $2^{2} \cdot 3^{1} \cdot 5^{0} \cdot 7^{0} = 4 \cdot 3 = 12$ ; by [L3] the valuations of $12$ against this list are exactly those exponents, so $12$ has the valuation vector of $\gcd (360, 84)$ and therefore equals it by [L4].

step 3.1step 3.2L1L2L3L4

4.2

Taking maxima entrywise gives $3, 2, 1, 1$ , and $2^{3} \cdot 3^{2} \cdot 5 \cdot 7 = 72 \cdot 35 = 2520$ ; the same argument gives $lcm (360, 84) = 2520$ .

step 3.1step 3.2L1L2L3L4

5.1

First check, the Euclidean algorithm. $4 \cdot 84 = 336$ and $336 + 24 = 360$ with $0 \leq 24 < 84$ ; $3 \cdot 24 = 72$ and $72 + 12 = 84$ with $0 \leq 12 < 24$ ; $2 \cdot 12 = 24$ and $24 + 0 = 24$ with $0 \leq 0 < 12$ . By the uniqueness in [L5] these are the divisions of the descent, whose last nonzero remainder is $12$ , so $\gcd (360, 84) = 12$ by [L6], agreeing with step 4.1.

step 4.1L1L5L6algebra

5.2

Second check, the product formula. $12 \cdot 2520 = 30240$ and $360 \cdot 84 = 30240$ , and $360 \cdot 84 > 0$ so $∣ 360 \cdot 84 ∣ = 360 \cdot 84$ ; this is [L7], agreeing with steps 4.1 and 4.2.

step 4.1step 4.2L1L7algebra

6.1

The factorisations, the valuation table, and both values of $\gcd$ and $lcm$ are verified, and the two independent checks agree.

step 4.1step 4.2step 5.1step 5.2∎

Remarks

The cross-check is the point of the example. The Euclidean algorithm: for $a \in Z$ and $b > 0$ the remainder descent from $(a, b)$ terminates, and the last nonzero remainder is $\gcd (a, b)$ computes $\gcd (360, 84)$ without ever mentioning a prime, and the exponent recipe computes it without ever performing a division; they return the same integer because For positive integers $a$ and $b$ and every prime $p$ : $v_{p} (\gcd (a, b)) = \min {v_{p} (a), v_{p} (b)}$ and $v_{p} (lcm (a, b)) = \max {v_{p} (a), v_{p} (b)}$ ; so the exponent-wise greatest common divisor is the $\gcd$ of the divisibility page and not a second notion proves the recipe identifies the $\gcd$ of Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ rather than defining a rival.
Which method is practical is a separate question. Factoring $360$ and $84$ is easy because they are small; for large integers the Euclidean algorithm is the only one of the two that runs, since no factorisation is needed. Nothing here claims anything about the cost of either procedure.
The exponent $0$ columns matter. $v_{5} (84) = 0$ and $v_{7} (360) = 0$ are what make the same list serve both numbers, and clause 2 of For $n \geq 1$ and any injective list $p : r \to Z$ of primes containing every prime divisor of $n$ , one has $n = \prod_{i < r} p_{i}^{v_{p_{i}} (n)}$ ; the exponents are determined by $n$ , and $v_{q} (n) = 0$ for every prime $q$ outside the list is the statement that every prime off the list contributes $0$ as well.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

81 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

Fundamental theorem of arithmetic (Wikipedia) (standard reference, not scraped)
P-adic valuation (Wikipedia) (standard reference, not scraped)

360=23⋅32⋅5360=23⋅32⋅5 and 84=22⋅3⋅784=22⋅3⋅7, with gcd⁡(360,84)=12gcd(360,84)=12 and lcm⁡(360,84)=2520lcm(360,84)=2520 read off the exponents