#pgf
1 messages · Page 1 of 1 (latest)
Am I allowed to prove it for the general case
P(X=x) = (nCx)p^x (1-p)^(n-x)
then sub in n = 4 and p = 0.8 at the end, after estabilishing
Gx(t) = (pt+ (1-p))^n
Is that basically the same thing
Yeah if you can show that sum of nCx p^x (1-p)^(n-x) gives you that expansion
wait but
isnt it by inspection
It’s probably more work but it does show the result
No
like when u do t^x * P(X=x)
You’ll need to explain how it is by inspection
hm
so like i could say let a = pt or smth
show that its a binomial expansion
basically
Yeah exactly
You do need to explain it
But if you explain that it is “obviously” an expansion then it’s fine to sub in n=4 etc
I think its acc faster because im not really thinking about any numbers
its js general case which I already know how to prove