Related papers: Calculations relating to some special Harmonic num…

Let $H_n$ be the $n$-th harmonic number and let $v_n$ be its denominator. It is well known that $v_n$ is even for every integer $n\ge 2$. In this paper, we study the properties of $v_n$. One of our results is: the set of positive integers…

Algorithms for numerical computation of symmetric elliptic integrals of all three kinds are improved in several ways and extended to complex values of the variables (with some restrictions in the case of the integral of the third kind).…

This paper presents formulae for the sum of the terms of a harmonic progression of order $k$ with integer parameters, $\mathrm{HP}_k(n)$, and for the partial sums of its two associated Fourier series, $C^z_{k}(a,b,n)$ and $S^z_{k}(a,b,n)$.…

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Let $C(k,p)$ denote the smallest real number such that the estimate $|a_k|\leq C(k,p)\|f\|_{H^p}$ holds for every $f(z)=\sum_{n\geq0}a_n z^n$ in the $H^p$ space of the unit disc. We compute $C(2,p)$ for $0<p<1$ and $C(3,2/3)$, and identify…

We provide some examples which give evidence to the conjectures contained in my paper "Finiteness of $p$-Divisible Sets of Multiple Harmonic Sums" (math.NT/0303043). All the main theoretical results can be found in that paper.

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

We present a number of results about (finite) multiple harmonic sums modulo a prime, which provide interesting parallels to known results about multiple zeta values (i.e., infinite multiple harmonic series). In particular, we prove a…

In terms of the derivative operator and three hypergeometric series identities, several interesting summation formulas involving generalized harmonic numbers are established.

We arrive at some new relations for the prime number $P_n$, based on the logarithmic and absolute-value properties of the function $\pi(x)$.

Let $p$ be a prime. We discuss $p$-adic properties of various arithmetical functions related to the coefficients of modular form and generating functions. Modular forms are considered as a tool of solving arithmetical problems. Examples of…

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

We give estimates for the approximation numbers of composition operators on the Hp spaces, 1 $\le$ p \textless{} $\infty$.

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…

In this note, we extend the definition of multiple harmonic sums and apply their stuffle relations to obtain explicit evaluations of the sums $R_n(p,t)=\sum\nolimits_{m=0}^n m^p H_m^t$, where $H_m$ are harmonic numbers. When $t\le 4$ these…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

We describe a computer algorithm that searches for substitution rules on a set of triangles, the angles of which are all integer multiples of {\pi}/n. We find new substitution rules admitting 7-fold rotational symmetry at many different…

This paper presents new formulae for the harmonic numbers of order $k$, $H_{k}(n)$, and for the partial sums of two Fourier series associated with them, denoted here by $C^m_{k}(n)$ and $S^m_{k}(n)$. I believe this new formula for…

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…