Analytical problem from CSMO 2018
Clash Royale CLAN TAG#URR8PPP
up vote
2
down vote
favorite
This has been recently posted on aops:
(China Southeast Mathematical Olympiad 2018 Grade 11 P8)
Given a positive real $C geq 1$ and a sequence $a_1, a_2, ...$ of nonnegative real numbers satisfy
$$left|xlnx-sum_k=1^[x] left[fracxkright]a_kright| leq Cx,$$
where $[x]$ is the floor function of $x.$
Prove that for any real $y geq1,$
$$sum_k=1^[y] a_k<3Cy.$$
An obvious step might be this well-known identity:
$$sum_k=1^[x] left[fracxkright]a_k=sum_k=1^[x] Fleft(fracxkright),$$
where $F(x)$ is the sum of all $a_k, kleq x.$
Because this is olympiad-level, there should be an elementary solution but perhaps the bound could be improved using higher mathematics?
number-theory elementary-number-theory analytic-number-theory
add a comment |Â
up vote
2
down vote
favorite
This has been recently posted on aops:
(China Southeast Mathematical Olympiad 2018 Grade 11 P8)
Given a positive real $C geq 1$ and a sequence $a_1, a_2, ...$ of nonnegative real numbers satisfy
$$left|xlnx-sum_k=1^[x] left[fracxkright]a_kright| leq Cx,$$
where $[x]$ is the floor function of $x.$
Prove that for any real $y geq1,$
$$sum_k=1^[y] a_k<3Cy.$$
An obvious step might be this well-known identity:
$$sum_k=1^[x] left[fracxkright]a_k=sum_k=1^[x] Fleft(fracxkright),$$
where $F(x)$ is the sum of all $a_k, kleq x.$
Because this is olympiad-level, there should be an elementary solution but perhaps the bound could be improved using higher mathematics?
number-theory elementary-number-theory analytic-number-theory
add a comment |Â
up vote
2
down vote
favorite
up vote
2
down vote
favorite
This has been recently posted on aops:
(China Southeast Mathematical Olympiad 2018 Grade 11 P8)
Given a positive real $C geq 1$ and a sequence $a_1, a_2, ...$ of nonnegative real numbers satisfy
$$left|xlnx-sum_k=1^[x] left[fracxkright]a_kright| leq Cx,$$
where $[x]$ is the floor function of $x.$
Prove that for any real $y geq1,$
$$sum_k=1^[y] a_k<3Cy.$$
An obvious step might be this well-known identity:
$$sum_k=1^[x] left[fracxkright]a_k=sum_k=1^[x] Fleft(fracxkright),$$
where $F(x)$ is the sum of all $a_k, kleq x.$
Because this is olympiad-level, there should be an elementary solution but perhaps the bound could be improved using higher mathematics?
number-theory elementary-number-theory analytic-number-theory
This has been recently posted on aops:
(China Southeast Mathematical Olympiad 2018 Grade 11 P8)
Given a positive real $C geq 1$ and a sequence $a_1, a_2, ...$ of nonnegative real numbers satisfy
$$left|xlnx-sum_k=1^[x] left[fracxkright]a_kright| leq Cx,$$
where $[x]$ is the floor function of $x.$
Prove that for any real $y geq1,$
$$sum_k=1^[y] a_k<3Cy.$$
An obvious step might be this well-known identity:
$$sum_k=1^[x] left[fracxkright]a_k=sum_k=1^[x] Fleft(fracxkright),$$
where $F(x)$ is the sum of all $a_k, kleq x.$
Because this is olympiad-level, there should be an elementary solution but perhaps the bound could be improved using higher mathematics?
number-theory elementary-number-theory analytic-number-theory
asked Aug 3 at 13:47
Ahmbak
380110
380110
add a comment |Â
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2871085%2fanalytical-problem-from-csmo-2018%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password