668
Primes (lemmy.ml)
submitted 3 years ago by to c/memes@lemmy.ml
73 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 7 points 3 years ago (2 children)

Often things hold true for all primes except 2. You come across things like "for all non two primes"

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 4 child comments
    •
  • [–] 4 points 3 years ago* (2 children)

    Any examples? Sounds like you mean the reason why one is excluded from the primes because of the fundamental theorem of arithmetic.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 4 child comments
    •
  • [–] 3 points 3 years ago* (last edited 3 years ago) (1 child)

    No, he's right. "For any odd prime" is a not-unheard-of expression. It is usually to rule out 2 as a trivial case which may need to be handled separately.

    https://en.wikipedia.org/wiki/Fermat%27s_theorem_on_sums_of_two_squares

    https://www.jstor.org/stable/2047029

    https://www.jstor.org/stable/2374361

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 1 point 3 years ago (1 child)

    It's not unheard of no, but if you have to rule out two for some reason it's because of some other arbitrary choice. In the first instance (haven't yet looked at the second and third one) it has to do with the fact that a sum of "two" was chosen arbitrary. You can come up with other things that requires you to exclude primes up to five.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •