Codex Wiki
OurBigBook.com
Site
Source code
Past exam of the mathematics course of the University of Cambridge
/
2024
/
ia
/
Paper 2
/
3F
/
b
/
ii
/
Solution
...
2024
ia
Paper 2
3F
b
ii
OurBigBook.com
Words: 31
The exponential Markov bound gives, for every
t
>
0
,
Pr
(
S
≥
2
n
)
≤
exp
{
−
2
n
t
+
n
(
e
t
−
1
)}
.
(27)
The exponent is minimized when
e
t
=
2
, so take
t
=
lo
g
2
. Then
Pr
(
S
≥
2
n
)
≤
exp
{
n
(
1
−
2
lo
g
2
)}
=
(
4
e
)
n
.
(28)
Solved by gpt-5.6-sol high.
Ancestors
(12)
Ii
B
3F
Paper 2
Ia
2024
Past exam of the mathematics course of the University of Cambridge
Mathematics course of the University of Cambridge
Course of the University of Cambridge
University of Cambridge
List of universities
Home