Related papers: On a formula of T. Rivoal

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…

A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Consider the set $\mathcal{K}$ of integers $k$ for which there are infinitely many primes $p$ such that $p+k$ is a power of $2$. The aim of this paper is to show a relationship between $\mathcal{K}$ and the limits points of some set…

Quaternionic analysis relies heavily on results on functions defined on domains in $\mathbb R^4$ (or $\mathbb R^3$) with values in $\mathbb H$. This theory is centered around the concept of $\psi-$hyperholomorphic functions i.e.,…

In 2023, the first author and Vandehey proved that the largest $k$ for which the string of equalities $\lambda(n+1)=\lambda(n+2)=\cdots=\lambda(n+k)$ holds for some $n\leq x$, where $\lambda$ is the Carmichael $\lambda$ function, is bounded…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…

For any quartic number field $K$ generated by a root $\alpha$ of an irreducible trinomial of type $x^4+ax^2+b\in Z[x]$, we characterize when $Z[\alpha]$ is integrally closed. Also for $p=2,3$, we explicitly give the highest power of $p$…

In our previous publication we have shown a method for calculating series of even powers of $\pi$ based on the product representation of the $sinc$ function. We refer the readers to [1] for more details. In this work we apply the method to…

In this paper we derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi's 4 and 8 squares identities to 4n^2 or 4n(n+1) squares, respectively, without using…

If b^2 + 1 is prime then b must be even, hence we examine the form 4u^2 + 1. Rather than study primes of this form we study composites where the main theorem of this paper establishes that if 4u^2 + 1 is composite, then u belongs to a set…

In this paper we show how to apply various techniques and theorems (including Pincherle's theorem, an extension of Euler's formula equating infinite series and continued fractions, an extension of the corresponding transformation that…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

The usual strategy for deducing the $\pi\mbox{--}\pi^\ast$ electronic energy (or optical bandgap) in a molecule with an "infinite" number of conjugated double bonds consists in fitting a function with some adjustable parameters to the…

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2…

We say that a permutation $\pi=\pi_1\pi_2\cdots \pi_n \in \mathfrak{S}_n$ has a peak at index $i$ if $\pi_{i-1} < \pi_i > \pi_{i+1}$. Let $\mathcal{P}(\pi)$ denote the set of indices where $\pi$ has a peak. Given a set $S$ of positive…

We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…

A remarkable result of Bergelson, Tao and Ziegler implies that if $c>0$, $k$ is a positive integer, $p\geq k$ is a prime, $n$ is sufficiently large, and $f:\mathbb F_p^n\to\mathbb C$ is a function with $\|f\|_\infty\leq 1$ and…