Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA common generalization of infinite sum, unordered sum and Riemann integral
80
0
0.0
(
0
)
Authors
Attila Losonczi
Ask ChatGPT about the research
No Arabic abstract
We present a common ground for infinite sums, unordered sums, Riemann integrals, arc length and some generalized means. It is based on extending functions on finite sets using Hausdorff metric in a natural way.
rate research
Read More
The Riemann hypothesis is equivalent to the $varpi$-form of the prime number theorem as $varpi(x) =O(xsp{1/2} logsp{2} x)$, where $varpi(x) =sumsb{nle x} bigl(Lambda(n) -1big)$ with the sum running through the set of all natural integers. Let ${mathsf Z}(s) = -tfrac{zetasp{prime}(s)}{zeta(s)} -zeta(s)$. We use the classical integral formula for the Heaviside function in the form of ${mathsf H}(x) =intsb{m -iinfty} sp{m +iinfty} tfrac{xsp{s}}{s} dd s$ where $m >0$, and ${mathsf H}(x)$ is 0 when $tfrac{1}{2} <x <1$, $tfrac{1}{2}$ when $x=1$, and 1 when $x >1$. However, we diverge from the literature by applying Cauchys residue theorem to the function ${mathsf Z}(s) cdot tfrac{xsp{s}} {s}$, rather than $-tfrac{zetasp{prime}(s)} {zeta(s)} cdot tfrac{xsp{s}}{s}$, so that we may utilize the formula for $tfrac{1}{2}< m <1$, under certain conditions. Starting with the estimate on $varpi(x)$ from the trivial zero-free region $sigma >1$ of ${mathsf Z}(s)$, we use induction to reduce the size of the exponent $theta$ in $varpi(x) =O(xsp{theta} logsp{2} x)$, while we also use induction on $x$ when $theta$ is fixed. We prove that the Riemann hypothesis is valid under the assumptions of the explicit strong density hypothesis and the Lindelof hypothesis recently proven, via a result of the implication on the zero free regions from the remainder terms of the prime number theorem by the power sum method of Turan.
If we cannot obtain all terms of a series, or if we cannot sum up a series, we have to turn to the partial sum approximation which approximate a function by the first several terms of the series. However, the partial sum approximation often does not work well for periodic functions. In the partial sum approximation of a periodic function, there exists an incorrect oscillation which cannot be eliminated by keeping more terms, especially at the domain endpoints. A famous example is the Gibbs phenomenon in the Fourier expansion. In the paper, we suggest an approach for eliminating such oscillations in the partial sum approximation of periodic functions.
Let $ xgeq 1 $ be a large number, let $ [x]=x-{x} $ be the largest integer function, and let $ sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ sum_{pleq x}sigma([x/p])=c_0xlog log x+O(x) $ over the primes, where $c_0>0$ is a constant. More generally, $ sum_{pleq x}sigma([x/(p+a)])=c_0xlog log x+O(x) $ for any fixed integer $a$.
Let $sum_{d|n}$ denote sum over divisors of a positive integer $n$, and $t_{r}(n)$ denote the number of representations of $n$ as a sum of $r$ triangular numbers. Then we prove that $$ sum_{d|n}frac{1+2,(-1)^{d}}{d}=sum_{r=1}^{n}frac{(-1)^{r}}{r}, binom{n}{r}, t_{r}(n) $$ using a result of Ono, Robbins and Wahl.
This paper proves that there does not exist a polynomial-time algorithm to the the subset sum problem. As this problem is in NP, the result implies that the class P of problems admitting polynomial-time algorithms does not equal the class NP of problems admitting nondeterministic polynomial-time algorithms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
