Search results
Jump to navigation
Jump to search
Page title matches
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:56, 20 May 2008
- In [[mathematics]], the '''unique factorization theorem''', also known as the '''fundamental theorem of arithmetic''' state ...om which all other whole numbers can be assembled through multiplication. Unique factorization is the foundation for most of the structure of whole numbers as described b3 KB (479 words) - 12:12, 9 April 2008
- 12 bytes (1 word) - 08:03, 15 November 2007
- ...r theorem]]) would either be nonsensical, or at least more complicated, if unique factorization did not hold. == A number system where unique factorization fails ==9 KB (1,496 words) - 06:25, 23 April 2008
- 134 bytes (20 words) - 15:55, 20 May 2008
- Auto-populated based on [[Special:WhatLinksHere/Unique factorization]]. Needs checking by a human.574 bytes (75 words) - 21:21, 11 January 2010
Page text matches
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:56, 20 May 2008
- #REDIRECT [[Unique factorization]]34 bytes (3 words) - 14:07, 12 May 2007
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:57, 20 May 2008
- #REDIRECT [[Unique factorization]]34 bytes (3 words) - 14:08, 12 May 2007
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:57, 20 May 2008
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:58, 20 May 2008
- #Redirect [[Unique factorization]]34 bytes (3 words) - 15:59, 20 May 2008
- #Redirect [[Unique factorization]]34 bytes (3 words) - 22:53, 3 April 2008
- #Redirect [[Unique factorization]]34 bytes (3 words) - 22:54, 3 April 2008
- {{r|unique factorization}} {{r|unique factorization domain}}356 bytes (46 words) - 13:02, 29 November 2008
- In [[mathematics]], the '''unique factorization theorem''', also known as the '''fundamental theorem of arithmetic''' state ...om which all other whole numbers can be assembled through multiplication. Unique factorization is the foundation for most of the structure of whole numbers as described b3 KB (479 words) - 12:12, 9 April 2008
- ...d domain <math>A</math> is a principal ideal domain if and only if it is a unique factorization domain.2 KB (306 words) - 15:51, 10 December 2008
- One method of finding the greatest common divisor of two integers involves [[Unique factorization|factoring]] both into [[prime number]]s:4 KB (570 words) - 18:05, 1 July 2009
- {{r|Unique factorization}}225 bytes (28 words) - 13:16, 14 June 2008
- ...r theorem]]) would either be nonsensical, or at least more complicated, if unique factorization did not hold. == A number system where unique factorization fails ==9 KB (1,496 words) - 06:25, 23 April 2008
- {{r|Unique factorization}}454 bytes (55 words) - 03:14, 21 October 2010
- ...or polynomials]] may be expressed as stating that for polynomials over a [[unique factorization domain]], the content of the product of two polynomials is the product of t971 bytes (132 words) - 15:00, 29 October 2008
- {{r|Unique factorization}}556 bytes (69 words) - 11:49, 11 January 2010
- {{r|Unique factorization}}498 bytes (64 words) - 16:23, 11 January 2010
- {{r|Unique factorization}}535 bytes (68 words) - 18:22, 11 January 2010