NOTICE: Citizendium is still being set up on its newer server, treat as a beta for now; please see here for more.
Citizendium - a community developing a quality comprehensive compendium of knowledge, online and free. Click here to join and contribute—free
CZ thanks our previous donors. Donate here. Treasurer's Financial Report -- Thanks to our content contributors. --

User talk:Greg Martin

From Citizendium, the Citizens' Compendium
Jump to: navigation, search
Citizendium Editor Policy
The Editor Role | Approval Process | Article Deletion Policy | Other
See also: Citizendium Council | Content Policy | Help for Editors
Getting Started Organization Communication Technical Help Initiatives
Policies Editor Guidance Content Guidance Article Lists Governance
Welcome Page

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)

On the other hand ...

I've been wanting to change "On one hand" to "On the one hand" (in the 2nd paragraph of the proof of infinity of primes at Prime number/Draft) but am hesitating only because I wouldn't want to change something that was the preferred way to say it in the dialect of whoever put it in. Apparently it came from your medium-thorough rewrite on May 5. If you're a native English speaker and "on one hand" is more correct than "on the one hand" in your dialect, I wouldn't change it. A google search suggests that "on the one hand" is a much more common expression than "on one hand". ("On the other hand" is even more common by far. My theory is that people hesitate to say "on the one hand" because they're confused as to whether to include the "the", so they just don't say it, but there is no such problem with "on the other hand" where the "the" is quite obviously appropriate.) To me, "on one hand" sounds odd, (or confusing -- possibly talking about an actual physical hand or something -- it makes me wonder whether the idea of counting on one's fingers is about to be introduced), while "on the one hand" sounds scholarly. --Catherine Woodgold 08:53, 12 May 2007 (CDT)

Responded on Catherine's talk page - Greg Martin 15:55, 12 May 2007 (CDT)


Hi Greg!

Harald Helfgott 12:55, 8 November 2007 (CST)


There area number of articles in cryptography that may be near approval. list. Some, such as RSA and discrete logarithm, really need a math editor to improve or approve them. Sandy Harris 06:23, 24 March 2009 (UTC)

Returning to Citizendium: an update on the project and how to get involved

Hello - some time ago you became part of the Citizendium project, but we haven't seen you around for a while. Perhaps you'd like to update your public biography or check on the progress of any pages you've edited so far.

Citizendium now has 16,939 articles, with 0 approved by specialist Editors such as yourself, but our contributor numbers require a boost. We have an initiative called 'Eduzendium' that brings in students enrolled on university courses to write articles for credit, but we still need more Editors across the community to write, discuss and approve material. There are some developed Mathematics articles that could be improved and approved, and some high-priority Natural Sciences articles that we don't have yet. You can also create new articles via this guide, and contribute to some Mathematics pages that have been recently edited - or to any others on Citizendium, since you're a general Author as well as a specialist Editor. You may like to contribute to discussions in the forums, and might consider running for an elected position on the Management and Editorial Councils that oversee the project.

If you have any questions, let me know via my Talk page or by leaving a message below this one. Thank you for signing up and reading this update; I hope that you will look in on our community soon. John Stephenson 16:12, 30 October 2011 (UTC)