Related papers: Primitive weird numbers having more than three dis…

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…

Primitive polynomials over finite fields are crucial for various domains of computer science, including classical pseudo-random number generation, coding theory and post-quantum cryptography. Nevertheless, the pursuit of an efficient…

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…

Any positive integer $n$ other than 10 with abundancy index 9/5 must be a square with at least 6 distinct prime factors, the smallest being 5. Further, at least one of the prime factors must be congruent to 1 modulo 3 and appear with an…

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

We present a special-purpose algorithm for factoring semiprimes $N = pq$ in which one prime factor satisfies $p \approx c\,(a/b)^n$ for positive integers $a, b, c, n$ with $a > b$ and $\gcd(a,b) = 1$. Given the correct parameters $(a, b)$,…

We describe a primality test for number $M=(2p)^{2^n}+1$ with odd prime $p$ and positive integer $n$. And we also give the special primality criteria for all odd primes $p$ not exceeding 19. All these primality tests run in polynomial time…

We make many new observations on primitive roots modulo primes. For an odd prime $p$ and an integer $c$, we establish a theorem concerning $\sum_g(\frac{g+c}p)$, where $g$ runs over all the primitive roots modulo $p$ among $1,\ldots,p-1$,…

The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…

We prove astonishing identities generated by compositions of positive integers. In passing, we obtain two new identities for Stirling numbers of the first kind. In the two last sections we clarify an algebraic sense of these identities and…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…

In 1992, Erd$\H{o}$s and Hegyv$\'{a}$ri showed that for any prime p, there exist infinitely many length 3 weakly prime-additive numbers divisible by p. In 2018, Fang and Chen showed that for any positive integer m, there exists infinitely…

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 this paper, we introduce and study a variant of Kummer's notion of (ir)regularity of primes which we call G-irregularity. It is based on Genocchi numbers $G_n$, rather than Bernoulli number $B_n.$ We say that an odd prime $p$ is…

Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…

An integer $n\geq 1$ is a $v$-palindrome if it is not a multiple of $10$, nor a decimal palindrome, and such that the sum of the prime factors and corresponding exponents larger than $1$ in the prime factorization of $n$ is equal to that of…

In this work, the author shows a sufficient and necessary condition for an integer of the form $(zn-y^n)/(z-y)$ to be divisible by some perfect $mth$ power $p$, where $p$ is an odd prime and $m$ is a positive integer. A constructive method…

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or…