Search results

Page title matches

• Unique Factorization
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:56, 20 May 2008
• Unique factorization
  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 b
  3 KB (479 words) - 12:12, 9 April 2008
• Talk:Unique factorization
  ...which whole numbers. Actually, Euclid didn't show that these numbers have unique factorization, but only that if a whole number is a product of distinct primes p_1 p_2 p_ ...ue factorization". However, there are other mathematical objects for which unique factorization is an important concept: polynomial rings and rings of integers in number f
  7 KB (1,092 words) - 12:14, 9 April 2008
• Unique factorization/Definition
  134 bytes (20 words) - 15:55, 20 May 2008
• Template:Unique factorization/Metadata
  | pagename = Unique factorization | abc = Unique factorization
  685 bytes (60 words) - 09:26, 15 March 2024
• Unique factorization/Approval
  12 bytes (1 word) - 08:03, 15 November 2007
• Unique factorization/Advanced
  ...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
• Unique factorization/Related Articles
  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

• Fundamental Theorem of arithmetic
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:57, 20 May 2008
• Fundamental theorem of Arithmetic
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:58, 20 May 2008
• Prime Factorization
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:59, 20 May 2008
• Unique prime factorization
  #REDIRECT [[Unique factorization]]
  34 bytes (3 words) - 14:07, 12 May 2007
• Fundamental Theorem of Arithmetic
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 22:53, 3 April 2008
• Prime factorization
  #REDIRECT [[Unique factorization]]
  34 bytes (3 words) - 14:08, 12 May 2007
• Fundamental theorem of arithmetic
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 22:54, 3 April 2008
• Unique Factorization
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:56, 20 May 2008
• Unique Prime Factorization
  #Redirect [[Unique factorization]]
  34 bytes (3 words) - 15:57, 20 May 2008
• Template:Unique factorization/Metadata
  | pagename = Unique factorization | abc = Unique factorization
  685 bytes (60 words) - 09:26, 15 March 2024
• Dedekind domain/Related Articles
  {{r|unique factorization}} {{r|unique factorization domain}}
  356 bytes (46 words) - 13:02, 29 November 2008
• Unique factorization
  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 b
  3 KB (479 words) - 12:12, 9 April 2008
• Dedekind domain
  ...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
• Greatest common divisor/Tutorials
  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
• Prime number/Related Articles
  {{r|Unique factorization}}
  225 bytes (28 words) - 13:16, 14 June 2008
• Unique factorization/Advanced
  ...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
• Fermat's last theorem/Related Articles
  {{r|Unique factorization}}
  454 bytes (55 words) - 03:14, 21 October 2010
• Content (algebra)
  ...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 t
  971 bytes (132 words) - 15:00, 29 October 2008
• Talk:Unique factorization
  ...which whole numbers. Actually, Euclid didn't show that these numbers have unique factorization, but only that if a whole number is a product of distinct primes p_1 p_2 p_ ...ue factorization". However, there are other mathematical objects for which unique factorization is an important concept: polynomial rings and rings of integers in number f
  7 KB (1,092 words) - 12:14, 9 April 2008
• Chinese remainder theorem/Related Articles
  {{r|Unique factorization}}
  556 bytes (69 words) - 11:49, 11 January 2010