Students helping students, join us in improving Bored of Studies by donating and supporting future students!
you cant, the flaw lies:BIRUNI said:That Proof was interesting man
Acmilan, How would you do it?
This is similar to me saying something like:proof of s(k+1): k+1 consists of k people plus one person, from our assumtion k people would like to stay in this topic and from our s(1) one person would like to stay on topic (that is Pluvia) so K+1 people would like to stay on topic
I think a proof by contradiction would be more appropriate for a statement like that.BIRUNI said:Now Vafa can you prove by induction there is only one God.
I thought this was amusing; even those it's not completely logical, it's still worth a laugh.vafa said:Proof By Induction:
S(n): n people in this thread would like to stay on topic. when n is a natural number.
S(1): 1 person in this thread would like to stay on topic and this is true because Pluvia indicated that he would like to stay on topic and he/she is 1 person. Hence the statement is true for n=1
S(k): assumme k people in this thread would like to stay on topic.
s(k+1): k+1 people in this thread would like to stay on topic.
proof of s(k+1): k+1 consists of k people plus one person, from our assumtion k people would like to stay in this topic and from our s(1) one person would like to stay on topic (that is Pluvia) so K+1 people would like to stay on topic
Hece s(n) is true for n=1, it is then true for n=2 and hence for n=3 and so on for all natural numbers.
Conclusion:
Since the statement "n people in this thread would like to stay on topic" is true for 1 person and that is pLuvia, Then statement is true for n=2, it means 2 people would like to stay on topic and hence for n=3, it means 3 people would like to stay on topic and so on for all natural numbers, it means everyone in this thread would like to stay on topic.