Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

amriju Group Title

Can any of u provide a logical proof of the statement " There is no end to the number of prime numbers?"

  • one year ago
  • one year ago

  • This Question is Closed
  1. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    hi @amriju. how are you?

    • one year ago
  2. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    I think I am fine...

    • one year ago
  3. mikaa_toxica13 Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    there is no endd to numbers period. it goes 999,999,999,999,999,999,999,999,999,999,999,999,999---- and so on. there is no end. so the prime numbers go on and on. no nd to either :) hope i helpd.

    • one year ago
  4. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    there is no end to the number of prime numbers because numbers go on and on and not all of our numbers are disible by more than just one and itself.

    • one year ago
  5. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    No dear..I need something logical...u kno..give me a theoritical proof...not based on exprience. @mikaa_toxica13

    • one year ago
  6. mikaa_toxica13 Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    then i am sorry. maybe @Eulie can help :) good luck

    • one year ago
  7. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    how can u prove that...if i wud say after a nuber x..all numbers are divisible...by smaller numbers other than 1...how wud u prove me wrong...? @ Eulie

    • one year ago
  8. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    Euclid's Proof So let's suppose that there are only finitely many primes, say n of them. We could then make a list of these n primes, say p1, p2, ..., pn. Then consider the integer obtained by multiplying all of the primes, and then adding 1. This new number m is either prime or it is not. But m is clearly larger than all of p1, p2, ..., pn so it cannot be one of the primes. So m is not prime, and therefore must be evenly divisible by some prime. But we are supposing that the only primes are p1 through pn--and none of these primes divides m evenly, for when m is divided by one of these primes, the remainder is 1. This contradiction shows that the supposition that p1, p2, ..., pn is a complete list of all primes must be false. Our conclusion is that there are not finitely many primes; there are infinitely many. Can We Generate all Primes?

    • one year ago
  9. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    How Many Primes are There? We will now consider the question of how many prime numbers there are. The following investigation of this question is over two thousand years old, and is attributed to Euclid. Two possible answers to the question are that there are either finitely many primes, or there are infinitely many of them. We will show that the first answer is not possible, and therefore there are infinitely many primes. (This approach is referred to as "proof by contradiction." In general, proof by contradiction works like this: we know that there are only two possible answers to a question; we assume that the first answer is the correct one, and then discover that this leads to an inconsistency; and so we conclude that it is actually the second of the two answers that is correct.)

    • one year ago
  10. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    Suppose that p1,p2,p3.....pn are all of the primes. Then consider N = p1*p2*p3*......pn + 1 N is divisible by some prime pk and pk also divides p1*p2*p3..*pn so pk divides N - p1*p2*p3....pn. That is, pk divides 1. Since pk is >=2, contradiction so the original supposition is wrong and there must be another prime not in the list. Evidently u can repeat this argument as often as u please.

    • one year ago
  11. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    go to http://www.jcu.edu/math/vignettes/primes.htm...... that may help

    • one year ago
  12. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    @estudier has a point

    • one year ago
  13. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    U are wonderful....both ur display pic( lol) and ur answer....thnx a lot. @Eulie and u have a final point in the proof...@estudier ...i recon i give the former a medal..and the former gives the latter a medal...:P

    • one year ago
  14. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    lol .. i rquested u give estudier a medal...@Eulie

    • one year ago
  15. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    how eo i do that?

    • one year ago
  16. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    cant do that in this ques anyway....u need to click on best response...and u can do that only once for a ques...where n what do u study anyway..?

    • one year ago
  17. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    im a senior

    • one year ago
  18. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    does that mean u r not studing any more...? u must be frm the US or Canada....i dont get ur terms like middle school..etc etc...

    • one year ago
  19. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    im from the us

    • one year ago
  20. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    thats why u use terms like senior....in india here....we wud say a pass out...if u have already got a degree..

    • one year ago
  21. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    oh im sorry....um i dont know what kindof name that is and u dont hav a pic... ar u male or female?

    • one year ago
  22. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    thats not my real name of crse...and i am a male...or else i wud nt hav chatted wit u for so long.. to be frank...lol

    • one year ago
  23. Eulie Group Title
    Best Response
    You've already chosen the best response.
    Medals 3

    oh okay... u should put ur pic up so i can see if your as cute as u sound

    • one year ago
  24. amriju Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    correctn " as u write"...u havn't hrd my voice ...hey i cud jst catch u later coz i need to go offline now..my mail id...riju_ian@yahoo.com...u cud send urs here if u do not have any probs byezzzz...take care...

    • one year ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.