Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
sauravshakya
Group Title
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
 2 years ago
 2 years ago
sauravshakya Group Title
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
 2 years ago
 2 years ago

This Question is Closed

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

estudier Group TitleBest ResponseYou've already chosen the best response.0
Maybe not....
 2 years ago

sauravshakya Group TitleBest ResponseYou've already chosen the best response.0
I dont know..... But I think it will not be surely prime.
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
If not, we just need a counterexample.
 2 years ago

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

UnkleRhaukus Group TitleBest ResponseYou've already chosen the best response.0
remainder is gonna be one
 2 years ago

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

estudier Group TitleBest ResponseYou've already chosen the best response.0
Euclid never said there was an infinity of primes (didn't believe in infinity)
 2 years ago

swissgirl Group TitleBest ResponseYou've already chosen the best response.3
t(5)=2*3*7*43+1=1807 1807/13=139
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
Euclid said that you could always construct another one out of a supposedly complete list.
 2 years ago

UnkleRhaukus Group TitleBest ResponseYou've already chosen the best response.0
that dosent make sense
 2 years ago

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

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

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

estudier Group TitleBest ResponseYou've already chosen the best response.0
The method, I agree, is very like the question.....
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
P_n = p1p2p3....+1
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
The "infinitely many" part got added later.....
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
Personally, I like "you can always get another one" better....
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
"Construct another one"
 2 years ago

UnkleRhaukus Group TitleBest ResponseYou've already chosen the best response.0
do you mean induction
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
No, it is an explicit construction...
 2 years ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
You give me a list of primes and say "That's all there are" And I give you another one not in the list...
 2 years ago
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
 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.