Talk:Prime number/Draft: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Greg Woodhouse
m (basic cleanup)
 
imported>Greg Woodhouse
(Primes and their generalizations)
Line 10: Line 10:
|                  by = [[User:Greg Woodhouse|Greg Woodhouse]] 20:17, 4 April 2007 (CDT)
|                  by = [[User:Greg Woodhouse|Greg Woodhouse]] 20:17, 4 April 2007 (CDT)
}}
}}
== Primes and their generalizations ==
After some thought, I added a clarification to the introductory material. The reason is that while the rational primes (i.e., primes in <math>\mathbb{Z}</math>) are very important in cryptographic applications, other engineering applications (notably error detecting and correcting codes, where linear codes are very important) depend upon properties of primes and factorization in other rings (such as <math>\mathbb{F}_2[x]</math>). It may seem like a small thing, but I do want to be sure that the claims made in the introductory section are correct. [[User:Greg Woodhouse|Greg Woodhouse]] 05:41, 5 April 2007 (CDT)

Revision as of 05:41, 5 April 2007


Article Checklist for "Prime number/Draft"
Workgroup category or categories Mathematics Workgroup [Categories OK]
Article status Stub: no more than a few sentences
Underlinked article? No
Basic cleanup done? Yes
Checklist last edited by Greg Woodhouse 20:17, 4 April 2007 (CDT)

To learn how to fill out this checklist, please see CZ:The Article Checklist.





Primes and their generalizations

After some thought, I added a clarification to the introductory material. The reason is that while the rational primes (i.e., primes in ) are very important in cryptographic applications, other engineering applications (notably error detecting and correcting codes, where linear codes are very important) depend upon properties of primes and factorization in other rings (such as ). It may seem like a small thing, but I do want to be sure that the claims made in the introductory section are correct. Greg Woodhouse 05:41, 5 April 2007 (CDT)