Related papers: Generalized Schatunowsky theorem in a weak arithme…

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}$…

In this article, we study the representability of integers as sums of pentagonal numbers, where a pentagonal number is an integer of the form $P_5(x)=\frac{3x^2-x}{2}$ for some non-negative integer $x$. In particular, we prove the…

Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

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,\ldots,d_{k}],$ with all partial quotients…

The Strong Goldbach conjecture dates back to 1742. It states that every even integer greater than four can be written as the sum of two prime numbers. Since then, no one has been able to prove the conjecture. The only best known result so…

In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…

In 2003, H\'{e}thelyi and K\"{u}lshammer proposed that if $G$ is a finite group and $p$ is a prime dividing the group order, then $k(G)\geq 2\sqrt{p-1}$, and they proved this conjecture for solvable $G$ and showed that it is sharp for those…

\textit{{\small We aim to get an algebraic generalization of Alladi-Johnson's (A-J) work on Duality between Prime Factors and the Prime Number Theorem for Arithmetic Progressions - II, using the Chebotarev Density Theorem (CDT). It has been…

A set of positive integers is primitive (or 1-primitive) if no member divides another. Erd\H{o}s proved in 1935 that the weighted sum $\sum1/(n \log n)$ for $n$ ranging over a primitive set $A$ is universally bounded over all choices for…

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…

We prove that in every ring of generalised power series with non-positive real exponents and coefficients in a field of characteristic zero, every series admits a factorisation into finitely many irreducibles of infinite support, the number…

Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

We study the Goldbach problem for primes represented by the polynomial $x^2+y^2+1$. The set of such primes is sparse in the set of all primes, but the infinitude of such primes was established by Linnik. We prove that almost all even…

B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…

Drawing inspiration from the work of Nathanson and Yamada we prove that every even integer larger than $\exp (\exp (32.7))$ can be written as the sum of a prime and the product of at most two primes.

H\'ethelyi and K\"ulshammer showed that the number of conjugacy classes $k(G)$ of any solvable finite group $G$ whose order is divisible by the square of a prime $p$ is at least $(49p+1)/60$. Here an asymptotic generalization of this result…

In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…