Related papers: Progress towards a nonintegrality conjecture
Erd\"{o}s and Niven proved in 1946 that for any positive integers $m$ and $d$, there are at most finitely many integers $n$ for which at least one of the elementary symmetric functions of $1/m, 1/(m+d), ..., 1/(m+(n-1)d)$ are integers.…
Iterative imputation is a popular tool to accommodate missing data. While it is widely accepted that valid inferences can be obtained with this technique, these inferences all rely on algorithmic convergence. There is no consensus on how to…
For each positive integer $r$, let $S_r$ denote the $r^{th}$ Schemmel totient function, a multiplicative arithmetic function defined by \[S_r(p^{\alpha})=\begin{cases} 0, & \mbox{if } p\leq r; \\ p^{\alpha-1}(p-r), & \mbox{if } p>r…
We will tackle a conjecture of S. Seo and A. J. Yee, which says that the series expansion of $1/(q,-q^3;q^4)_\infty$ has nonnegative coefficients. Our approach relies on an approximation of the generally nonmodular infinite product…
${\cal E}$ denotes the family of all finite nonempty $S\subseteq{\mathbb N}:=\{1,2,\ldots\}$, and ${\cal E}(X):={\cal E}\cap\{S:S\subseteq X\}$ when $X\subseteq{\mathbb N}$. Similarly, ${\cal F}$ denotes the family of all finite nonempty…
The uncountability of $\mathbb{R}$ is one of its most basic properties, known far outside of mathematics. Cantor's 1874 proof of the uncountability of $\mathbb{R}$ even appears in the very first paper on set theory, i.e. a historical…
The purpose of this paper is twofold. First, we derive theoretically, using appropriate transformation on $x_n$, the closed-form solution of the nonlinear difference equation \[ x_{n+1} = \frac{1}{\pm 1 + x_n},\qquad n\in \mathbb{N}_0. \]…
Bessenrodt and Ono, Chen, Wang and Jia, DeSalvo and Pak were the first to discover the log-subadditivity, log-concavity, and the third-order Tur\'{a}n inequality of partition function, respectively. Many other important partition statistics…
In this paper, we show that if the numbers in the range $[1,2^n]$ satisfy Collatz conjecture, then almost all integers in the range $[2^n+1,2^{n+1}]$ will satisfy the conjecture as $n \to \infty$. The previous statement is equivalent to…
We prove that if $\sum_n n! c_n z^n$ is entire and $c_n$ does not terminate, then $\sum_n c_n z^n$ has infinitely many zeros. We then use this result to give alternative proofs that the Le Roy functions $f_r(z)=\sum_{n=0}^\infty…
We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…
In a previous paper, we provided a formal definition for the concept of computational irreducibility (CIR), i.e. the fact for a function f from N to N that it is impossible to compute f(n) without following approximately the same path than…
Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…
We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…
Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
We prove the following results solving a problem raised in [Y. Caro, R. Yuster, On zero-sum and almost zero-sum subgraphs over $\mathbb{Z}$, Graphs Combin. 32 (2016), 49--63]. For a positive integer $m\geq 2$, $m\neq 4$, there are…
Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…
Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…