Given functions f(a,b) = random(a) < random(b) and g(a,b) = a < random(a+b)
which if of them is more likely to result into 1, if random(n) returns arbitrary number in range of [0;n)?
Justify your answer.
Name:
Anonymous2016-08-08 15:04
<anime> f(a,b) = random(a) < random(b) and g(a,b) = a < random(a+b) <anime> how to prove they're equal? <dalcde> anime: No one can help you until you make yourself comprehensible. <anime> ok * gfixler has quit (Ping timeout: 265 seconds) * GoldenKey has quit (Read error: Connection reset by peer) <FilipinosRich> dalcde what was the link again to your group theory notes <FilipinosRich> If you don't mind me asking <dalcde> dec41.user.srcf.net <---------- ### LEL hes a cambridge math toilet scrubber <FilipinosRich> Thanks <anime> dalcde, maybe if you had more than 2 IQ points to rub together you could figure it out ;) <dalcde> This is ##math, not ##psychology. <dalcde> We are not psychics. <FilipinosRich> Lool <xrlk> lol i hope you didnt spend 2 minutes brainstorming that comeback <xrlk> hey Z-module got any SICK maths to teach me today???? <Svitkona> anime, what do you mean by "equal" <Svitkona> what is random(a) <anime> = <xrlk> XD <anime> it's a random number from 0 to a <Svitkona> ok, what does f(a, b) = random(a) < random(b) mean <anime> this is basic stuff dude <xrlk> XD <FilipinosRich> lmfao <Svitkona> can you explain, then? <anime> why act like this is confusing or hard <xrlk> ebin trolle <someone13> a chick once stabbed me
turns out /prog/ is smarter than cambridge math teachers, who knew?