Related papers: A Note on Deaconescu's Conjecture

In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

Our main source of inspiration was a talk by Hendrik Lenstra on harmonic numbers, which are numbers whose only prime factors are two or three. Gersonides proved 675 years ago that one can be written as a difference of harmonic numbers in…

We prove that, for any prime number $p\geq 5$, the set of natural numbers $n$ such that $p\mid H_n$ is finite.

Define $\|n\|$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $\|n\| \ge 3\log_3 n$ for all $n$. Define the defect of…

Let $d$ be a fixed positive integer and let $\epsilon>0$. It is shown that for every sufficiently large $n\geq n_0(d,\epsilon)$, the $d$-dimensional unit cube can be decomposed into exactly $n$ smaller cubes such that the ratio of the side…

The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…

Let $x$ and $n$ be positive integers. We prove a non-trivial lower bound for $x$, dependant only on $\omega_n$, the number of distinct prime factors of $x^n-1$. By considering the divisibility of $\varphi \mid x^n-1$ for $\varphi \mid n$,…

The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…

In 1876, Edouard Lucas showed that if an integer $b$ exists such that $b^{n-1} \equiv 1 (\mathrm{mod} \ n)$ and $b^{(n-1)/p} \not\equiv 1( \mathrm{mod} \ n)$ for all prime divisors $p$ of $n-1$ , then $n$ is prime, a result known as Lucas's…

Define $||n||$ to be the complexity of $n$, the smallest number of ones needed to write $n$ using an arbitrary combination of addition and multiplication. The set $\mathscr{D}$ of defects, differences $\delta(n):=||n||-3\log_3 n$, is known…

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

We study the properties of the product, which runs over the primes, $$\mathfrak{p}_n = \prod_{s_p(n) \, \geq \, p} p \quad (n \geq 1),$$ where $s_p(n)$ denotes the sum of the base-$p$ digits of $n$. One important property is the fact that…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…