AMEN567889 SG 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..
spadeTwo SG nope.. you have to show how you form an equation with n, and deriving at that particular equation. in which.. i dun understand the question, so i cant help.
jondizzle foshizzle SG this is easy sh*t n=number of people so therefore n(n-1)/2=number of different handshakes
AMEN567889 SG dun xia lan urself here la...i said use MI liaos la.. u got eyes or not? or rather u got any brain?
caleb_chiang SG Hmm... n people each have (n-1) handshake. Total number of handshake would be n(n-1) It take 2 person to perform one handshare, thus the number times handshare occur would be n(n-1)/2 Get it?
AMEN567889 SG dun xia lan urself can? learn to read! i said use MI to prove..u dumb fark..really du lan liaos
AMEN567889 SG no...its a new topic... tutorial first question i dun know liaos... u dun say etc etc la..show me how lehs =/
^tamago^ SG i suppose u do that to ur lecturers, tutors and classmates if u go ard asking them for help and this happens? i'm glad i'm not in ur class.
caleb_chiang SG dun xia lan urself??? dun understand you. You want to use MI, then use MI lah. but if you dun understand the formula in the first place, how you use MI? Prove it by using subsitution method... The one who is really 'xia suay'ing himself if you.
