A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 4 years ago
t(1)=2
t(2)=3
t(3)=t(1)*t(2)+1
t(4)=t(1)*t(2)*t(3)+1
.
.
.
t(n)=t(1)*t(2)*t(3)*...*t(n1)+1
PROVE or DISPROVE that t(n) will surely be PRIME
anonymous
 4 years ago
t(1)=2 t(2)=3 t(3)=t(1)*t(2)+1 t(4)=t(1)*t(2)*t(3)+1 . . . t(n)=t(1)*t(2)*t(3)*...*t(n1)+1 PROVE or DISPROVE that t(n) will surely be PRIME

This Question is Closed

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.0This sounds like a very hard problem.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0I dont know..... But I think it will not be surely prime.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0If not, we just need a counterexample.

TuringTest
 4 years ago
Best ResponseYou've already chosen the best response.0I doubt it is all primes as well.

UnkleRhaukus
 4 years ago
Best ResponseYou've already chosen the best response.0remainder is gonna be one

klimenkov
 4 years ago
Best ResponseYou've already chosen the best response.1Looks like an Euclid proof of the infinite number of prime numbers.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Euclid never said there was an infinity of primes (didn't believe in infinity)

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0t(5)=2*3*7*43+1=1807 1807/13=139

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Euclid said that you could always construct another one out of a supposedly complete list.

UnkleRhaukus
 4 years ago
Best ResponseYou've already chosen the best response.0that dosent make sense

klimenkov
 4 years ago
Best ResponseYou've already chosen the best response.1There are infinitely many primes, as demonstrated by Euclid around 300 BC. http://en.wikipedia.org/wiki/Prime_number

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0True but he never said anything about infinity (Greeks weren't too keen on that idea)

klimenkov
 4 years ago
Best ResponseYou've already chosen the best response.1You deepened into the history. But I spoke about the method.

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The method, I agree, is very like the question.....

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0The "infinitely many" part got added later.....

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0Personally, I like "you can always get another one" better....

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0"Construct another one"

UnkleRhaukus
 4 years ago
Best ResponseYou've already chosen the best response.0do you mean induction

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0No, it is an explicit construction...

anonymous
 4 years ago
Best ResponseYou've already chosen the best response.0You give me a list of primes and say "That's all there are" And I give you another one not in the list...
Ask your own question
Sign UpFind more explanations on OpenStudy
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
 Engagement 19 Mad Hatter
 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.