Maths question...hard =(
-
wah so evil.Originally posted by JusticeLegal:Wat a farking dumb prick
Go home and do your own homework and tutorial. Don't ask people do for you. Useless piece of shit. M.I. also don't know. Pay attention during lectures and don't go and look at girls. Quit your stupid CO and go and study. Useless totally useless Your parents are farking pathetic to give birth to you -
AMEN!!! ^(-_-^)
-
Should say n=1 too. One person = no hand shake , so equation still correct.Originally posted by greengoblin:Will not do the full induction here. Fill in the gaps yourself.
Let P_k be the statement "the number of handshakes for n ppl in a party where each person shakes another person's hand only once = n(n - 1)/2" where n is in the set of natural numbers and n > 1
P(2) is trivial.
Assume P(k) is true for some k in the set of natural numbers and again k > 1.
Now let us consider the case for k + 1 ppl. We consider the number of hand shakes the k + 1 person has to make with the rest of the k ppl in the grp. Clearly, he needs to shake k times.
Hence the number of total number hand shakes that occur = k(k - 1)/2 + k
= k(k + 1)/2
This implies P(k+1) is true.
Hence P(k) is true => P(k + 1)
P(2) => P(3) => P(4)...
Hence P(n) is true by M.I.
Quite trivial question. Try proving using combinatorics. The answer is sweeter.
Move to n=2
Then the following steps of urs are correct.
TS remember to say the concluding statement in ur final step.
To TS: Humility worls wonder. Courteousy is the way to go
-
I wonder why people still help TS when he obviously doesn't want to help himself..
I bet he puposely was absent from school on the last day since its the last day anyway, so heck with classes...
And from his attitude towards people who's willing to help him shows that he won't survive long when he reaches the working time...
I doubt he can even pass his A Levels...(Or dip)..
Good luck TS... -
The TS is just a lazy arse... if he's got a question, he jolly well go and approach his lecturer for notes.
His attitude is seriously questionable and highly deserves our condemnation! Look at his uncouth replies to forumers who tries to help him... bet he is just another person lacking in both IQ as well as EQ. Singapore can do without people like him. -
The problem, I believe that there ARE,many people in Singapore who are like him..Originally posted by bigmouthjoe:The TS is just a lazy arse... if he's got a question, he jolly well go and approach his lecturer for notes.
His attitude is seriously questionable and highly deserves our condemnation! Look at his uncouth replies to forumers who tries to help him... bet he is just another person lacking in both IQ as well as EQ. Singapore can do without people like him.
-
Really huh? Guess it's the upbringing... respecting others is a good way to avoid conflict and make more friends.Originally posted by RvnRooRon84:The problem, I believe that there ARE,many people in Singapore who are like him.. 
-
2 people go into the room with 2 people insideOriginally posted by AMEN567889:1.
As a grp of ppl arrive at a meeting, each shakes hands with all the other ppl present. use mathematical induction to show if n ppl come to the meeting , then n(n-1)/2 handshakes occur..
how?
wth..
2(2-1)/2 = 1
only 1 handshake occur? -
Actually, the questions means that the room is empty before the "n" people arrive and start shaking hands. How else would it be possible for two people to have more than one handshake? <_<Originally posted by Xcert:2 people go into the room with 2 people inside
2(2-1)/2 = 1
only 1 handshake occur? -
x2.Originally posted by RvnRooRon84:I wonder why people still help TS when he obviously doesn't want to help himself..
I bet he puposely was absent from school on the last day since its the last day anyway, so heck with classes...
And from his attitude towards people who's willing to help him shows that he won't survive long when he reaches the working time...
I doubt he can even pass his A Levels...(Or dip)..
Good luck TS...
TS need to change his attitude abit.. -
Well, his method is not wrong though, except that he has to mention about P(2) is also true. And there's an error in your answer jondizzle foshizzle, it should be n(n-1)/2 not n(n+1)/2. Not quite a big mistake but an ECF, you would earn some marks. I pity you. ><Originally posted by jondizzle foshizzle:to show my superiority and ur stupidity ill solve it using MI u dumb f*ckhead u better be grateful
For any positive integer n, 1 + 2 + ... + n = n(n+1)/2.
Proof by MI: Let's let P(n) be the statement 1 + 2 + ... + n = (n (n+1)/2
The idea is that P(n) should be an assertion that for any n is verifiably either true or false
Verify that P(1) is True. P(1) asserts 1 = 1(2)/2 which true
Prove the following assertion --- If there is a k such that P(k) is true, then (for this same k) P(k+1) is true Thus, there is a k such that 1 + 2 + ... + k = k (k+1)/
Prove, for this same k, the formula 1 + 2 + ... + k + (k+1) = (k+1)(k+2)/2
1 + 2 + ... + k + (k+1) = k(k+1)/2 + (k+1) = (k(k+1) + 2 (k+1))/2 = (k+1)(k+2)/2. The first equality is a consequence of the inductive assumption.
now bow down before me u stupid piece of f*ck -
damn i learn this is 1st 3 mths at Millenia. now go poly forgot how to do le..
-
lolz this is induction
I did it in my discrete maths class until wan to vomit blood
if you are in that class as well, good luck to you. It is known to be one of the hardest classes around
And if you are in that class, you need to remedy your attitude also. You will need a lot of help in the future from your classmates and teachers. If you give them this kinda attitude, I can safely say they will not help you at all -
let Pk be the proposition that ....
-
Maybe that's why he had to resort to coming to forums to ask.Originally posted by rainee:And if you are in that class, you need to remedy your attitude also. You will need a lot of help in the future from your classmates and teachers. If you give them this kinda attitude, I can safely say they will not help you at all -
MI is difficult at first. but after a while it is actually quite easy. just that the manipulation is a pain in the ass.
-
omh use MI =\
-
cmon gimme some credit im only 15Originally posted by akinos:Well, his method is not wrong though, except that he has to mention about P(2) is also true. And there's an error in your answer jondizzle foshizzle, it should be n(n-1)/2 not n(n+1)/2. Not quite a big mistake but an ECF, you would earn some marks. I pity you. >< -
Originally posted by AMEN567889:
Why, in the first place, did you miss the lecture? If you're good, and can do all the questions, then by all means, skip your lectures. But you have totally no idea on how to start, and you want to skip your lectures? That's totally dumb, man. And thats the way you ask questions ? People are doing you a favour, damn it. They're not entitled to do so. I'll now do an experiment.
this is a new topic..[b]i missed that lecture which was conducted on the last day of school..now i nid do my tutorial..and i dun know wth is MI at all...
furthermore i alreasy state in my question use MI to prove..if use sub method to prove i come here ask for wad?? stupid dumb fark[/b]
Which would you prefer?
1) Hey dude! How old is your mother this year?
or
2) Hey b*stard, how fu*king old is your bit*hy mother ?
I'm sure you would choose the former.
If you chose the latter, all i can tell you is that you're a fagg*t. -
lol? what so funny about it?Originally posted by AMEN567889:u too!! fug off
you don't deserve privil. to create topics. -
lol TS just got told off by like 20 people and has yet to reply...
-
up for TS!
-
haha! don't worry! not flaming/scolding you or anything. There is just a careless mistake there. Anyway, you are right in the method. Hearts for you, cheer up, ignore the TS. =DOriginally posted by jondizzle foshizzle:cmon gimme some credit im only 15 -
TS, so no answers to our queries?
-
AMEN.