Related papers: A Fractional $3n+1$ Conjecture

Let $S= \{ p_1, \ldots, p_s\}$ be a finite, non-empty set of distinct prime numbers and $(U_{n})_{n \geq 0}$ be a linear recurrence sequence of integers of order $r$. For any positive integer $k,$ we define $(U_j^{(k)})_{j\geq 1}$ an…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

Mills proved that there exists a real constant $A>1$ such that for all $n\in \mathbb{N}$ the values $\lfloor A^{3^n}\rfloor$ are prime numbers. No explicit value of $A$ is known, but assuming the Riemann hypothesis one can choose $A=…

In this note we introduce three problems related to the topic of finite Hausdorff moments. Generally speaking, given the first n+1 (n in N or n=0) moments, alpha(0), alpha(1),..., alpha(n), of a real-valued continuously differentiable…

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0=a_0<a_1<\cdots<a_t$, the \emph{Stanley sequence} $S(A)=\{a_n\}$ is defined using the greedy algorithm: For each…

In 1973, Neil Sloane published a very short paper introducing an intriguing problem: Pick a decimal integer $n$ and multiply all its digits by each other. Repeat the process until a single digit $\Delta(n)$ is obtained. $\Delta(n)$ is…

In \cite{d4}, we gave a method to construct a continued fraction of the function $F(x):=e^{x}E_{1}(x)$. More precisely we define $F_{1}(x)$ as the reciprocal of $F(x)$ and we inductively define $F_{m}(x)$ as the reciprocal of ``$F_{m-1}(x)$…

We show an iterated function of which iterates oscillate wildly and grow at a dizzying pace. We conjecture that the orbit of arbitrary positive integer always returns to 1, as in the case of Collatz function. The conjecture is supported by…

We consider the concatenation of $t$ uniformly random perfect matchings on $2n$ vertices, where the operation of concatenation is inspired by the multiplication of generators of the Brauer algebra $\mathfrak{B}_n(\delta)$. For the resulting…

Let $x$ be a irrational number in the unit interval and denote by its continued fraction expansion $[a_1(x), a_2(x), \cdots, a_n(x), \cdots]$. For any $n \geq 1$, write $T_n(x) = \max_{1 \leq k \leq n}\{a_k(x)\}$. We are interested in the…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Let $\alpha$ be a real number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha$ and its nearest integer.

In this paper, we will introduce an extension to the Collatz's conjecture. This conjecture may be seen as a general conjecture that unifies the Collatz one together with many other similar conjectures. For instance, we propose our new…

Let $$\lambda(s)=\sum_{n=0}^\infty\frac1{(2n+1)^s},$$ $$\beta(s)=\sum_{n=0}^\infty\frac{(-1)^{n}}{(2n+1)^s},$$ and $$\eta(s)=\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n^s}$$ be the Dirichlet lambda function, its alternating form, and the Dirichlet…

We consider a natural filtration $\boldsymbol{\operatorname{Bad}}(\delta) \subset \boldsymbol{\operatorname{Bad}}(\delta')$ for $\delta \geq \delta'>0$ on the set of badly approximable numbers to complement the filtration of the well…

We state a general purpose algorithm for quickly finding primes in evenly divided sub-intervals. Legendre's conjecture claims that for every positive integer $n$, there exists a prime between $n^2$ and $(n+1)^2$. Oppermann's conjecture…

We intend to contribute to the Collatz dynamics problem by seeking to analyze the Collatz conjecture from the tree of numbers sequences. First, we show numerically that the distribution of odd numbers has an initial transient, and proceeds…

Let $(x_n)$ be a positive real sequence decreasing to $0$ such that the series $\sum_n x_n$ is divergent and $\liminf_{n} x_{n+1}/x_n>1/2$. We show that there exists a constant $\theta \in (0,1)$ such that, for each $\ell>0$, there is a…

In 2007, Andrews and Paule introduced the family of functions $\Delta_k(n)$, which enumerate the number of broken $k$-diamond partitions for a fixed positive integer $k$. In 2013, Radu and Sellers completely characterized the parity of…

This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…