Loading ...
Sorry, an error occurred while loading the content.

Re: [PrimeNumbers] short proofs

Expand Messages
  • Jose Ramón Brox
    What happened to this thread? I enjoyed it. Would be any web publications of the proof recolected? Are any more proofs wanted? Jose Brox ... From:
    Message 1 of 7 , May 4 2:19 PM
    • 0 Attachment
      What happened to this thread? I enjoyed it.

      Would be any web "publications" of the proof recolected?

      Are any more proofs wanted?

      Jose Brox


      ----- Original Message -----
      From: xyzenogenicyx
      To: primenumbers@yahoogroups.com
      Sent: Monday, April 21, 2003 8:27 PM
      Subject: [PrimeNumbers] short proofs



      everyone please send in a cool short proof based on primes.


      one of my favorites is , the factorial of n with n > 1 can never be a
      square... using bertrands postulate there is always a prime between
      k and 2k. From this it follows that there is a prime that divides n!
      but whose square does not. because in the prime
      factorization of a square all exponents are even, thus n! cannot be a
      perfect square.



      Yahoo! Groups Sponsor



      Unsubscribe by an email to: primenumbers-unsubscribe@yahoogroups.com
      The Prime Pages : http://www.primepages.org/



      Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.



      [Non-text portions of this message have been removed]
    Your message has been successfully submitted and would be delivered to recipients shortly.