Related papers: The many faces of the Kempner number
The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s…
Borwein, Bailey, and Girgensohn (2004) asked whether the following infinite series converges: the sum of $(\frac{2}{3} + \frac{1}{3} \sin n)^n / n$ over all positive integers $n$. We prove that their series converges. The proof uses the…
In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…
In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…
Using a general $q$-series expansion, we derive some nontrivial $q$-formulas involving many infinite products. A multitude of Hecke--type series identities are derived. Some general formulas for sums of any number of squares are given. A…
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…
Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…
We present several congruences modulo a power of prime $p$ concerning sums of the following type $\sum_{k=1}^{p-1}{m^k\over k^r}{2k\choose k}^{-1}$ which reveal some interesting connections with the analogous infinite series.
Recently, using modular forms F. Beukers posed a unified method that can deal with a large number of supercongruences involving binomial coefficients and Ap\'ery-like numbers. In this paper, we use Beukers' method to prove some conjectures…
The classical multidimensional resultant can be defined as the, suitably normalized, generator of a projective elimination ideal in the ring of universal coefficients. This is the approach via the so-called inertia forms or…
We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…
The concern of this paper is to show that there always exist Krasner hyperfields of order n, where n is an integer greater than or equal to 2.
Cauchy's sum theorem is a prototype of what is today a basic result on the convergence of a series of functions in undergraduate analysis. We seek to interpret Cauchy's proof, and discuss the related epistemological questions involved in…
Kummer's test from 1835 states that the positive series $\sum_{n=1}^\infty a_n$ is convergent if and only if there is a sequence $\{ B_n\}_1^\infty$ of positive numbers such that $B_n\cdot \frac{a_n }{a_{n+1}} -B_{n+1}\geq 1 ,$ for all…
In this article, we count the number of return words in some infinite words with complexity 2n+1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the…
We review Hilbert's classical analytical proof of the transcendence of the number $\mathrm{e}$. Then, we show how this result can be obtained algebraically by means of formal power series (FPS). We give two proofs of the transcendence of…
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…
Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…
We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…
We use the arithmetic of the Kummer surface associated to the Jacobian of a hyperelliptic curve to study the primality of integers of the form $4m^2 5^n-1$. We provide an algorithm capable of proving the primality or compositeness of most…