Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Comment on

( #3333=superdoc: print w/replies, xml ) Need Help??
You claim that 1 is not a prime by definition, and This is a useful definition since it allows integers to have a unique prime factorization. But note:
6 = 2 * 3 = 3 * 2 = (-2) * (-3) = (-3) * (-2)
Therefore the uniqueness of prime factorization is only uniqueness up to some defined equivalence relation of factorizations. There is no reason we can't define this equivalence so that stray factors of +-1 don't matter.

Indeed the standard definition most people know of a prime is something like, A positive integer is prime if it is only divisible by 1 and itself. Arguing about whether 1 is prime is a question of arguing about whether those two statements need to be separate. Which is a pretty minor difference.

As I say I point this out because when I was taking upper level number theory I would run across articles which made comments like, "X's counts are off by one from Y's because X counted 1 as prime." When I first saw this I was flabbergasted. Then I was told that everyone knew it didn't really matter one way or the other, so some people who were trying to produce long lists of primes counted 1 just as an easy way of improving their count. (This isn't something that people have done much of recently because it is simpler to generate lists than to find somewhere to store it.)

So there isn't really a definite answer within the positive integers. The definition that 1 is not prime does generalize more nicely into abstract algebra (primes generate prime ideals which leave you with integral domains when you mod out by them). And most people use it most of the time. But that usage isn't universally set in stone in my experience.

You also point out that, Less controversially, 0 is not prime... which is absolutely true. I have never seen anyone claim that 0 is a prime. The closest that I have seen is things like having people who study the p-adic number fields refer to the reals as the 0-adics, and 0 as "the infinite prime". (Try factoring 0 to see where the "infinite" bit comes from.)

In reply to Re (tilly) 5: Prime Number Finder by tilly
in thread Prime Number Finder by munchie

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?

    What's my password?
    Create A New User
    and all is quiet...

    How do I use this? | Other CB clients
    Other Users?
    Others avoiding work at the Monastery: (5)
    As of 2018-02-19 08:59 GMT
    Find Nodes?
      Voting Booth?
      When it is dark outside I am happiest to see ...

      Results (260 votes). Check out past polls.