Related papers: Fun With Fourier Series
We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.
Using properties of the Riemann zeta-function we propose two new large classes of evaluated series. Incidentally the first class represents integrals as generalized average on very nonuniform sequences. The second class contains inter alia…
The Fourier transform is typically seen as closely related to the additive group of real numbers, its characters and its Haar measure. In this paper, we propose an alternative viewpoint; the Fourier transform can be uniquely characterized…
We exploit some properties of the Hurwitz zeta function $\zeta (n,x)$ in order to study sums of the form $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}1/(jk+l)^{n}$ and $\frac{1}{\pi ^{n}}\sum_{j=-\infty}^{\infty}(-1)^{j}/(jk+l)^{n}$ for $%…
We present a new method for producing series for $1/\pi$ and other constants using Legendre's relation, starting from a generation function that can be factorised into two elliptic $K$'s; this way we avoid much of modular theory or creative…
Inversion of function sinc(x) is studied. New series and integral representations of branches of inverse function are obtained using Fourier analysis.
We study explicit continued fraction expansions for certain series. Some of these expansions have symmetry that generalizes some remarkable examples discovered independently by Kmosek and Shallit. Furthermore, we prove the following…
Using the expansion in a Fourier-Gegenbauer series, we prove several identities that extend and generalize known results. In particular, it is proved among other results, that \begin{equation*}…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials…
Let $W_0(\mathbb R)$ be the Wiener Banach algebra of functions representable by the Fourier integrals of Lebesgue integrable functions. It is proven in the paper that, in particular, a trigonometric series $\sum\limits_{k=-\infty}^\infty…
Several problems on Fourier series and trigonometric approximation on a hexagon and a triangle are studied. The results include Abel and Ces\`aro summability of Fourier series, degree of approximation and best approximation by trigonometric…
A novel representation of a quasi-periodic modified von Mangoldt function L(n) on prime numbers and its decomposition into Fourier series has been investigated. We focus on some particular quantities characterizing the modified von Mangoldt…
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
A general integral expression to transform power series is applied to $\arcsin{x}$ and its positive integer powers. We concentrate on the first to the fourth powers and obtain infinite classes of new power series involving central binomial…
Using a simple transformation, we obtain much simpler forms for some series involving binomial coefficients $\binom{3n}n$ derived by Necdet Batir. New evaluations are given; and connections with Fibonacci numbers and the golden ratio are…
It is well-known in industrial data science that large values of real-life time series tend to be structured and often follow concrete and visible patterns. In this paper, we use ideas from additive combinatorics and discrete Fourier…
The problem of representing a given positive integer as a sum of four squares of integers has been widely concerned for a long time, and for a given positive odd $n$ one can find a representation by doing arithmetic in a maximal order of…
In this paper we show that a methodology based on a sampling with the Gaussian function of kind $h\,{e^{ - {{\left( {t/c} \right)}^2}}}/\left( {{c}\sqrt \pi } \right)$, where ${c}$ and $h$ are some constants, leads to the Fourier transform…
In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…