Revision history of "Prime factorization is unique"

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • curprev 18:48, 24 January 2022‎ Beijayl talk contribs‎ m 2,679 bytes +474‎ slight restructuring
  • curprev 22:19, 23 January 2022‎ Beijayl talk contribs‎ 2,205 bytes +2,205‎ Created page with "'''Prime factorization is unique''' is, in the context of the integers, part of the fundamental theorem of arithmetic. But the claim can be proven more generally in the context of abstract algebra. The uniqueness here refers to uniqueness except for multiplication with a unit. In the case of the integers the units are <math>1</math> and <math>-1</math>, so <math>6=2\cdot 3 = (-2)\cdot (-3)</math> is considered a unique factorization even though <math>-2, -3</math> als..."
Retrieved from "https://arguably.io/Prime_factorization_is_unique"