sigh
Okay, the definitve answer. ^___^
the defn of 0^0 is plain silly. Because the only way you get numbers to the power of zero from basic axioms, power definitions etc is to start from x=x^1 and divide, you get x/x=x^0. But you can't divide by 0 so 0/0 and hence 0^0 is plain silly...
The reason you can get 0^(0.1), for example, is that you can say 0^1=0
and letting the weird number above be m
m^10=0^1=0
so m=0
But doing 0^0 is a whole different ball game...
2. You know probability of k heads in n coins is nCk/2^n
So probability of both ppl getting k heads is (nCk)^2/2^2n
So all you have to prove is that (the sum from 0 to n of (nCk)^2)/2^2n=(2n)! / [2^(2n) * (n!)^2]
ie sum from 0 to n of (nCk)^2)=(2n)!/(n!)^2 (note lhs = no. of ways of getting same no of heads)
So restating problem 2:
Equivalent to -
Show that the number of ways that they get the same number of heads is
(2n)Cn.
Proof: By establishing a bijection (ie correlating one way to get same heads with one way to pick n items from 2n).
Arrange the 2n objects in a row, and draw a line down the middle (separating objects into left and right). The ones you pick, tick them, the ones you don't, cross them.
A tick means heads on the left, and tails on the right. A cross means tails on the left, and heads on the right.
This establishes a relation between the two, basically as it "preserves" the constant k between the two sides, k being (left heads-left tails)-(right heads - right tails). cross decreases k by 1, ticks increases by 1. As cross=ticks, k stays at 0 by the time all the ticks and crosses are converted into heads and tails ie heads-tails is same on both sides ie heads is same on both sides.