Home
Random
Nearby
Log in
Settings
Donate
About Wikipedia
Disclaimers
Search
User
:
Kworb/Sandbox
User page
Talk
Language
Watch
Edit
<
User:Kworb
Y
=
{
P
(
A
∣
X
=
0
)
if
X
=
0
;
P
(
A
∣
X
=
1
)
if
X
=
1.
{\displaystyle Y={\begin{cases}P(A\mid X=0)&{\text{if }}X=0;\\P(A\mid X=1)&{\text{if }}X=1.\end{cases}}}
f
(
x
)
=
{
β
2
⋅
log
(
1
+
|
x
−
β
1
|
)
if
x
>
β
1
;
−
β
2
⋅
log
(
1
+
|
x
−
β
1
|
)
if
x
<
−
β
1
;
0
if
−
β
1
≤
x
≤
β
1
.
{\displaystyle f(x)={\begin{cases}\beta _{2}\cdot \log(1+|x-\beta _{1}|)&{\text{if }}x>\beta _{1};\\-\beta _{2}\cdot \log(1+|x-\beta _{1}|)&{\text{if }}x<-\beta _{1};\\0&{\text{if }}-\beta _{1}\leq x\leq \beta _{1}.\end{cases}}}
Δ
I
M
=
Δ
I
M
Y
−
1
+
f
(
T
G
R
)
+
g
(
C
T
G
R
)
+
h
(
T
R
−
T
T
R
)
{\displaystyle \Delta IM=\Delta IM_{Y-1}+f(TGR)+g(CTGR)+h(TR-TTR)\,}
(
x
+
y
)
n
=
∑
k
=
0
n
(
n
k
)
x
n
−
k
y
k
{\displaystyle (x+y)^{n}=\sum _{k=0}^{n}{n \choose k}x^{n-k}y^{k}}
So
(
1
+
2
x
)
n
=
∑
k
=
0
n
(
n
k
)
1
n
−
k
2
k
x
k
=
∑
k
=
0
n
(
n
k
)
2
k
x
k
{\displaystyle (1+2x)^{n}=\sum _{k=0}^{n}{n \choose k}1^{n-k}2^{k}x^{k}=\sum _{k=0}^{n}{n \choose k}2^{k}x^{k}}
Coefficient of x^2:
2
2
(
n
2
)
{\displaystyle 2^{2}{n \choose 2}}
Coefficient of x:
2
(
n
1
)
=
2
n
{\displaystyle 2{n \choose 1}=2n}
So
2
⋅
2
n
=
4
(
n
2
)
{\displaystyle 2\cdot 2n=4{n \choose 2}}
n
=
(
n
2
)
{\displaystyle n={n \choose 2}}
Or
n
=
n
!
2
!
(
n
−
2
)
!
=
n
!
2
(
n
−
2
)
!
{\displaystyle n={\frac {n!}{2!(n-2)!}}={\frac {n!}{2(n-2)!}}}
Or
2
n
=
n
!
(
n
−
2
)
!
=
n
(
n
−
1
)
=
n
2
−
n
{\displaystyle 2n={\frac {n!}{(n-2)!}}=n(n-1)=n^{2}-n}
So
n
2
−
3
n
=
0
{\displaystyle n^{2}-3n=0}
And n=3