User talk:Greg Martin: Difference between revisions
imported>Michael Hardy |
imported>Greg Martin m (→Your opinion on this point: response) |
||
| Line 34: | Line 34: | ||
== Your opinion on this point == | == Your opinion on this point == | ||
Hello. I wonder if you could post your opinion at [[ | Hello. I wonder if you could post your opinion at [[Talk:prime number/Draft]] concerning this point that I raised there? Thanks. [[User:Michael Hardy|Michael Hardy]] 15:51, 8 May 2007 (CDT) | ||
'''Highly misleading phrase''' | |||
The approved version of this article says: | The approved version of this article says: | ||
| Line 42: | Line 42: | ||
:: in fact, it factors completely into prime numbers, due to unique factorization | :: in fact, it factors completely into prime numbers, due to unique factorization | ||
That is very misleading at best. It implies that '''uniqueness''' rather than '''existence''' of the factorization is what entails that a number factors completely into primes. That is clearly false. Even in structures within which factorization is not unique at all, elements still factor completely into primes. Possibly the most well-known example is the ring of integers with a square root of −5 adjoined. | That is very misleading at best. It implies that '''uniqueness''' rather than '''existence''' of the factorization is what entails that a number factors completely into primes. That is clearly false. Even in structures within which factorization is not unique at all, elements still factor completely into primes. Possibly the most well-known example is the ring of integers with a square root of −5 adjoined. [[User:Michael Hardy|Michael Hardy]] 11:37, 7 May 2007 (CDT) | ||
'''(end of paste from article talk page)''' | |||
''I'll be responding on [[Talk:prime number/Draft]]. Short answer: [[User:Michael Hardy|Michael's]] right and we have a good plan to improve it. - [[User:Greg Martin|Greg Martin]] 14:25, 10 May 2007 (CDT)'' | |||
Revision as of 14:25, 10 May 2007
Welcome, new editor! We're very glad you've joined us. Here are pointers for a quick start. Also, when you get a chance, please read The Editor Role. You can look at Getting Started and our help system for other introductory pages. It is also important, for project-wide matters, to join the Citizendium-L (broadcast) mailing list. Announcements are also available via Twitter. You can test out editing in the sandbox if you'd like. If you need help to get going, the forum is one option. That's also where we discuss policy and proposals. You can ask any administrator for help, too. Just put a note on their "talk" page. Again, welcome and thank you! We appreciate your willingness to share your expertise, and we hope to see your edits on Recent changes soon. --Larry Sanger 15:14, 6 March 2007 (CST)
Big O notation
Hi, I proposed moving "Big O notation" to "Complexity of algorithms" or something like this. A constable (Matt) suggested that an opinion of an editor would be appreciated. So could you please take a look at Big O notation and my rationale given Matt's talk page and leave a comment there? Thanks in advance. --AlekStos 08:39, 26 March 2007 (CDT)
- Responded on Alek's talk page. - Greg Martin 17:58, 24 April 2007 (CDT)
Prime Numbers
Thank you so much for your editorial guidance in Prime Numbers. Nancy Sculerati 20:28, 25 April 2007 (CDT)
- I, too, appreciate your time. Thanks. Greg Woodhouse 09:17, 26 April 2007 (CDT)
Greg, you can edit the article yourself and still nominate it for approval. Every suggestion does not have to be carried out by others when an editor reviews a well developed article like Prime number for nomination for approval. Nancy Sculerati 09:39, 29 April 2007 (CDT)
Primes of the form n^2 + 1
This one is new to me. Off-hand, it seems that y = x^2 + 1 is of genus 0 and thus rationally equivalent to a line (not necessarily over Q, but over some finite extension). If it were rationally equivalent to a line over Q, it seems that we ought to be able to appeal to Dirichlet's theorem on infinitely many primes in an arithmetic progression. Just thinking out loud, I guess. Greg Woodhouse 11:15, 29 April 2007 (CDT)
- Responded on Greg W's talk page - Greg Martin 16:15, 29 April 2007 (CDT)
Talk Approval
I think it always does that, and you've made no error. David Tribe 20:16, 29 April 2007 (CDT)
An article on manifolds?
I've been thinking about writing an article on differentiable manifolds, but I always find myself starting out with something like "a manifold is a separable Hausdorff space such that..." Not the most inspiring of introductions. I'm wondering if I should just skip the manifold article (for now) and move on to something more interesting. What do you think? Greg Woodhouse 08:31, 1 May 2007 (CDT)
- Responded on Greg W's talk page - Greg Martin 14:45, 1 May 2007 (CDT)
Well, I've been thinking about it, and have some ideas, but still haven't completely made up my mind. There are just so many possible starting points. I've been watching Integral and I think I'll see what I can do to help there, and see which of my 3 or 4 article ideas starts to click first. Greg Woodhouse 18:31, 1 May 2007 (CDT)
Your opinion on this point
Hello. I wonder if you could post your opinion at Talk:prime number/Draft concerning this point that I raised there? Thanks. Michael Hardy 15:51, 8 May 2007 (CDT)
Highly misleading phrase
The approved version of this article says:
- in fact, it factors completely into prime numbers, due to unique factorization
That is very misleading at best. It implies that uniqueness rather than existence of the factorization is what entails that a number factors completely into primes. That is clearly false. Even in structures within which factorization is not unique at all, elements still factor completely into primes. Possibly the most well-known example is the ring of integers with a square root of −5 adjoined. Michael Hardy 11:37, 7 May 2007 (CDT)
(end of paste from article talk page)
I'll be responding on Talk:prime number/Draft. Short answer: Michael's right and we have a good plan to improve it. - Greg Martin 14:25, 10 May 2007 (CDT)