Talk:Prime number/Draft: Difference between revisions
imported>Jitse Niesen (→Just delete this?: some comments) |
imported>Greg Woodhouse |
||
Line 32: | Line 32: | ||
:* On a first reading, the proof of unique factorization looks a bit messy, though I can't articulate exactly what the problem is. I'll try to have a look at it later. | :* On a first reading, the proof of unique factorization looks a bit messy, though I can't articulate exactly what the problem is. I'll try to have a look at it later. | ||
:-- [[User:Jitse Niesen|Jitse Niesen]] 19:52, 5 April 2007 (CDT) | :-- [[User:Jitse Niesen|Jitse Niesen]] 19:52, 5 April 2007 (CDT) | ||
*I deleted the last sentence of the introduction, along with the reference to telemedicine. | |||
*What I think I was trying to do with the notation for "divides" (not that I really planned it out in advance) is inrouce the notation by using it, and then step back and explain what it means. I'll add something there. | |||
*The comment about the latter definition of "prime" being more characteristic of advanced work was inappropriate (and probably wrong). It's gone now. As I'm sure you realize, what I had in mind is that the concepts prime and irreducible just happen to coincide in '''Z''' because it's a PID. Right now, you're seeing my thoughts in rather raw form, and I guess I was thinking that I didn't want to get involved with a discussion of primes vs. irreducible elements, but I wanted to at least note that there is a difference. | |||
*I don't like what I wrote about unique factorization, either. I didn't really want to dwell on it too much, but by the time I had written it out, the argument was just too long, and a bit awkward sounding. I'll see what I can do. [[User:Greg Woodhouse|Greg Woodhouse]] 23:49, 5 April 2007 (CDT) |
Revision as of 22:49, 5 April 2007
Workgroup category or categories | Mathematics Workgroup [Categories OK] |
Article status | Developing article: beyond a stub, but incomplete |
Underlinked article? | No |
Basic cleanup done? | Yes |
Checklist last edited by | Greg Woodhouse 07:08, 5 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)
Just delete this?
I noticed that someone removed the hyperlinks from the latter part of the introductory paragraph, and I agree that this was a good idea. To be honest, I wouldn't mind just deleting
Understanding properties of prime numbers and their generalizations is essential to modern cryptography, and to public key ciphers that are crucial to Internet commerce, wireless networks, telemedicine and, of course, military applications. Less well known is that other computer algorithms also depend on properties of prime numbers. These algorithms allow computers to run faster, computer networks to carry more data with a greater degree of reliability, and are basic to the operation of many consumer electronics devices, such as television sets, DVD players, GPS devices, and more. Life as we know it today would not be possible without an understanding of prime numbers.
I put it in there to provide some motivation for the study of prime numbers, but I'm not so sure I don't find it distracting (or just plain too long) without the hyperlinks. Greg Woodhouse 10:14, 5 April 2007 (CDT)
- I think it's a bit too much; especially the last sentence. However, don't throw out the baby with the bath water. We do need some motivation. A simple solution would be to retain only the first sentence (personally, I'd also delete telemedicine).
- I had some other comments when I read through the article. I'll just jot them down here for you to consider or ignore as you see fit. You already resolved one of them (in Euclid's proof, explain why it's impossible that no prime divides N) by adding a discussion on unique factorization.
- The aside on notation. I think the definition of prime number without symbols works perfectly fine, making me wonder why you praise the virtues of notation at that place. Incidentally, you need to explain the notation a | b.
- The equivalence of the two definitions for prime numbers is in fact quite important (unique factorization depends on it), and should perhaps be stressed more.
- What do you have in mind when you say that the second definition is preferred in advanced number theory? It's a long time ago that I looked at number theory, but I thought both were used (they are called irreducible and prime elements, respectively).
- On a first reading, the proof of unique factorization looks a bit messy, though I can't articulate exactly what the problem is. I'll try to have a look at it later.
- -- Jitse Niesen 19:52, 5 April 2007 (CDT)
- I deleted the last sentence of the introduction, along with the reference to telemedicine.
- What I think I was trying to do with the notation for "divides" (not that I really planned it out in advance) is inrouce the notation by using it, and then step back and explain what it means. I'll add something there.
- The comment about the latter definition of "prime" being more characteristic of advanced work was inappropriate (and probably wrong). It's gone now. As I'm sure you realize, what I had in mind is that the concepts prime and irreducible just happen to coincide in Z because it's a PID. Right now, you're seeing my thoughts in rather raw form, and I guess I was thinking that I didn't want to get involved with a discussion of primes vs. irreducible elements, but I wanted to at least note that there is a difference.
- I don't like what I wrote about unique factorization, either. I didn't really want to dwell on it too much, but by the time I had written it out, the argument was just too long, and a bit awkward sounding. I'll see what I can do. Greg Woodhouse 23:49, 5 April 2007 (CDT)
- Mathematics Category Check
- General Category Check
- Category Check
- Advanced Articles
- Nonstub Articles
- Internal Articles
- Mathematics Advanced Articles
- Mathematics Nonstub Articles
- Mathematics Internal Articles
- Developed Articles
- Mathematics Developed Articles
- Developing Articles
- Mathematics Developing Articles
- Stub Articles
- Mathematics Stub Articles
- External Articles
- Mathematics External Articles
- Mathematics Underlinked Articles
- Underlinked Articles
- Mathematics Cleanup
- General Cleanup
- Cleanup