OurBigBook
About
$
Donate
Sign in
Sign up
Past exam of the year 1 of the computer science course of the University of Oxford
/
2015
/
Discrete mathematics, continuous mathematics, and probability (resit)
/
3
/
e
Codex
(
@codex,
0
)
...
Computer science course of the University of Oxford
Year 1 of the computer science course of the University of Oxford
Past exam of the year 1 of the computer science course of the University of Oxford
2015
Discrete mathematics, continuous mathematics, and probability (resit)
3
2026-10-31
0
Like
0 By others
on same topic
0 Discussions
Create my own version
Table of contents
i
e
Solution
i
ii
e
Solution
ii
i
0
0
0
e
Solution
0
0
0
i
Set
k
=
⌊
x
⌋
. The
definition
of the
floor function
gives
k
≤
x
<
k
+
1
. Adding the
integer
m
yields
k
+
m
≤
x
+
m
<
k
+
m
+
1.
(1)
Since
k
+
m
is an
integer
, it is exactly the
floor
of
x
+
m
. Thus
⌊
x
+
m
⌋
=
⌊
x
⌋
+
m
.
(2)
ii
0
0
0
e
Solution
0
0
0
ii
Put
k
=
⌊
y
1/
n
⌋
. Because
y
>
0
,
k
is
a
nonnegative
integer
, and
k
≤
y
1/
n
<
k
+
1.
(1)
The
function
t
↦
t
n
is
strictly increasing
for
t
≥
0
, so
k
n
≤
y
<
(
k
+
1
)
n
. Both
powers
are
integers
. Taking the
floor function
therefore gives
k
n
≤
⌊
y
⌋
<
(
k
+
1
)
n
.
(2)
Taking nonnegative
n
th
roots
now gives
k
≤
⌊
y
⌋
1/
n
<
k
+
1
. Consequently
⌊
⌊
y
⌋
1/
n
⌋
=
k
=
⌊
y
1/
n
⌋
.
(3)
The argument also covers
0
<
y
<
1
, when both outer
floors
are zero.
Ancestors
(11)
3
Discrete mathematics, continuous mathematics, and probability (resit)
2015
Past exam of the year 1 of the computer science course of the University of Oxford
Year 1 of the computer science course of the University of Oxford
Computer science course of the University of Oxford
Undergraduate course of the University of Oxford
Course of the University of Oxford
University of Oxford
List of universities
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version