Let $x \in (0, 2\pi)$. Is the series $\sum_{n=1}^{\infty} \frac{\cos(n^2x)}{n}$ convergent? My guess is: YES and I would like to use Dirichlet test: however I have troubles proving that the partial sums $\cos(x)+\cos(4x)+...+\cos(n^2x)$ are bounded due to the lack of the simple formula for this sum. Any ideas?
2026-04-09 13:21:36.1775740896
Convergence of the series $\sum_{n=1}^{\infty} \frac{\cos(n^2x)}{n}$.
390 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in REAL-ANALYSIS
- how is my proof on equinumerous sets
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- On sufficient condition for pre-compactness "in measure"(i.e. in Young measure space)
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Is this relating to continuous functions conjecture correct?
- What are the functions satisfying $f\left(2\sum_{i=0}^{\infty}\frac{a_i}{3^i}\right)=\sum_{i=0}^{\infty}\frac{a_i}{2^i}$
- Absolutely continuous functions are dense in $L^1$
- A particular exercise on convergence of recursive sequence
Related Questions in SEQUENCES-AND-SERIES
- How to show that $k < m_1+2$?
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- Negative Countdown
- Calculating the radius of convergence for $\sum _{n=1}^{\infty}\frac{\left(\sqrt{ n^2+n}-\sqrt{n^2+1}\right)^n}{n^2}z^n$
- Show that the sequence is bounded below 3
- A particular exercise on convergence of recursive sequence
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Powers of a simple matrix and Catalan numbers
- Convergence of a rational sequence to a irrational limit
- studying the convergence of a series:
Related Questions in CONVERGENCE-DIVERGENCE
- Finding radius of convergence $\sum _{n=0}^{}(2+(-1)^n)^nz^n$
- Conditions for the convergence of :$\cos\left( \sum_{n\geq0}{a_n}x^n\right)$
- Proving whether function-series $f_n(x) = \frac{(-1)^nx}n$
- Pointwise and uniform convergence of function series $f_n = x^n$
- studying the convergence of a series:
- Convergence in measure preserves measurability
- If $a_{1}>2$and $a_{n+1}=a_{n}^{2}-2$ then Find $\sum_{n=1}^{\infty}$ $\frac{1}{a_{1}a_{2}......a_{n}}$
- Convergence radius of power series can be derived from root and ratio test.
- Does this sequence converge? And if so to what?
- Seeking an example of Schwartz function $f$ such that $ \int_{\bf R}\left|\frac{f(x-y)}{y}\right|\ dy=\infty$
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Sorry for joining the discussion after two years but I wanted to share this rather interesting result regarding the discrete case. I realize that this is just a partial answer but I feel it is a bit too long to fit in a comment. So let us assume $$ x = \frac{2\pi p}{q}, $$ where $q \in \mathbb{N}$ and $p \in \{1, 2, \dots, q - 1\}$. Then the following holds:
In particular, the set of $x$ such that the series diverges is dense in $(0, 2\pi)$. To prove this, denote $$ \Delta := \sum_{n = 1}^{q} \cos(n^2x). $$ Now, thanks to $q$-periodicity, we can easily see that the series $$\sum_{n = 1}^{\infty} \left[\cos(n^2x) - \frac{\Delta}{q}\right] $$ has bounded partial sums and hence by Dirichlet test, the series $$\sum_{n = 1}^{\infty} \frac{\cos(n^2x)}{n} = \sum_{n = 1}^{\infty} \frac{1}{n}\left[ \cos(n^2x) - \frac{\Delta}{q}\right] + \frac{\Delta}{q}\sum_{n = 1}^{\infty} \frac{1}{n}$$ converges if and only if $\Delta = 0$. (This trick does not work when $x$ is an irrational multiple of $\pi$.) Next, we will need some basic number theory. Suppose that $q$ is an odd prime and define: $$\zeta := e^{ix}$$ $$ \phi(z) := z^{q - 1} + z^{q - 2} + \dots + 1, $$ $$ h(z) := \sum_{m = 1}^{q-1}\left(\frac{m}{q}\right)z^n, $$ where $$ \left(\frac{m}{q}\right)$$ is the Legendre symbol. Since $q$ is a prime, the multiplicative group modulo $q$ is cyclic. From the cyclic structure, it follows that each nonzero quadratic residue of $q$ is present in the sequence $1,4,9, \dots, (q-1)^2$ exactly twice. Hence \begin{align} \Delta &= 1 + \sum_{n = 1}^{q-1} \cos(n^2x),\\ &= 1 + 2\sum_{m \in (\mathbb{Z}/q\mathbb{Z})^\times \; \wedge \; \left(\frac{m}{q}\right) = 1} \cos(mx),\\ & = 1 + 2\sum_{m \in (\mathbb{Z}/q\mathbb{Z})^\times \; \wedge \; \left(\frac{m}{q}\right) = 1} \Re{(\zeta^m)} - \phi(\zeta),\\ & = \Re{(h(\zeta))}. \end{align} Note that $h(\zeta) \neq 0$ (this follows from the fact that $\zeta$ is already a root of an irreducible polynomial $\phi$ and from the observation that $h$ is clearly not divisible by $\phi$). Finally, we observe that \begin{align} h(\zeta) &= \sum_{m \in (\mathbb{Z}/q\mathbb{Z})^\times} \left(\frac{m}{q}\right)\zeta^m\\ &= \sum_{m \in (\mathbb{Z}/q\mathbb{Z})^\times} \left(\frac{-m}{q}\right)\zeta^{-m}\\ &= \left(\frac{-1}{q}\right)\overline{h}(\zeta).\\ \end{align} If $q = 1 \; (\text{mod} \; 4)$, then $-1$ is a quadratic residue of $q$ and so $h(\zeta)$ is real. Then $\Delta \neq 0$ and the series will diverge. If $q = 3 \; (\text{mod} \; 4)$, then $-1$ is not a quadratic residue of $q$ and so $h(\zeta)$ is imaginary. Then $\Delta = 0$ and the series will converge. (For analogical sine series, this would be vice versa.)
The following table lists whether the series converges or diverges based on the numerically computed sign of $\Delta$ for different values of $q$ (rows) and $p$ (columns), where
It shows that in the statement above, the assumption of primality is essential and the general case is more complicated. One can expect that the indiscrete case will be yet even more complicated.