Skip to main content
Post Closed as "Not suitable for this site" by Fernando Muro, Stefan Kohl, Daniel Loughran, Lucia, Denis Serre
deleted 209 characters in body; edited title
Source Link
Peng
  • 31
  • 5

Show Prove that $\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2})$

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. ShowProve that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}). \qquad(1)$$$$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}).$$ Where $\{x\}$ is the fractional part of $x$.

It's easy to prove that $$\{x\}=\frac{1}{2}+\int_0^1 (y-\mathbf{1}_{[\{x\},1]}(y))\,\mathrm{d}y,\qquad (2)$$ Where $\mathbf{1}_A(x)=\begin{cases} 1, & x\in A, \\ 0, & x\notin A. \end{cases}$

How to prove (1)? Is the (2) useful?

I find this problem in G.Tenenbaum's book in the page 118.

Gérald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge University Press, 1995.

Can you help me with this problem?

Show that $\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2})$

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. Show that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}). \qquad(1)$$ Where $\{x\}$ is the fractional part of $x$.

It's easy to prove that $$\{x\}=\frac{1}{2}+\int_0^1 (y-\mathbf{1}_{[\{x\},1]}(y))\,\mathrm{d}y,\qquad (2)$$ Where $\mathbf{1}_A(x)=\begin{cases} 1, & x\in A, \\ 0, & x\notin A. \end{cases}$

How to prove (1)? Is the (2) useful?

I find this problem in G.Tenenbaum's book in the page 118.

Gérald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge University Press, 1995.

Prove that $\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2})$

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. Prove that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}).$$ Where $\{x\}$ is the fractional part of $x$.

I find this problem in G.Tenenbaum's book in the page 118.

Gérald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge University Press, 1995.

Can you help me with this problem?

added 186 characters in body; edited tags
Source Link
Peng
  • 31
  • 5

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. Show that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}). \qquad(1)$$ Where $\{x\}$ is the fractional part of $x$.

It's easy to prove that $$\{x\}=\frac{1}{2}+\int_0^1 (y-\mathbf{1}_{[\{x\},1]}(y))\,\mathrm{d}y,\qquad (2)$$ Where $\mathbf{1}_A(x)=\begin{cases} 1, & x\in A, \\ 0, & x\notin A. \end{cases}$

How to prove (1)? Is the (2) useful?

I find this problem in G.Tenenbaum's book in the page 118.

Gérald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge University Press, 1995.

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. Show that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}). \qquad(1)$$ Where $\{x\}$ is the fractional part of $x$.

It's easy to prove that $$\{x\}=\frac{1}{2}+\int_0^1 (y-\mathbf{1}_{[\{x\},1]}(y))\,\mathrm{d}y,\qquad (2)$$ Where $\mathbf{1}_A(x)=\begin{cases} 1, & x\in A, \\ 0, & x\notin A. \end{cases}$

How to prove (1)? Is the (2) useful?

Let $a,b\in\mathbb{Z}$, and $f\in C^2([a,b])$ such that $|f''(t)|\asymp \lambda$ for $a\le t\le b$. Show that $$\sum_{a<n\le b}\{f(n)\}=\frac{1}{2}(b-a)+O(\lambda^{1/3}(b-a)+\lambda^{-1/2}). \qquad(1)$$ Where $\{x\}$ is the fractional part of $x$.

It's easy to prove that $$\{x\}=\frac{1}{2}+\int_0^1 (y-\mathbf{1}_{[\{x\},1]}(y))\,\mathrm{d}y,\qquad (2)$$ Where $\mathbf{1}_A(x)=\begin{cases} 1, & x\in A, \\ 0, & x\notin A. \end{cases}$

How to prove (1)? Is the (2) useful?

I find this problem in G.Tenenbaum's book in the page 118.

Gérald Tenenbaum. Introduction to Analytic and Probabilistic Number Theory, Cambridge: Cambridge University Press, 1995.

Irrelevant tags removed
Link
Alex Degtyarev
  • 5k
  • 5
  • 23
  • 26
Source Link
Peng
  • 31
  • 5
Loading