相关论文: Almost all palindromes are composite

We compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…

We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken…

We introduce two new classes of integers. The first class consists of numbers $N$ for which there exists at least one nonnegative integer $A$, such that the sum of $A$ and the sum of digits of $N$, added to the reversal of the sum, gives…

Around the year 2007, one of the authors, Tsai, accidentally discovered a property of the number $198$ he saw on the license plate of a car. Namely, if we take $198$ and its reversal $891$, which have prime factorizations $198 = 2\cdot…

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

The set $A$ is an asymptotic nonbasis of order $h$ for an additive abelian group $X$ if there are infinitely many elements of $X$ not in the $h$-fold sumset $hA$. For all $h \geq 2$, this paper constructs new classes of asymptotic nonbases…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

Prime number multiplet classifications and patterns are extended to negative integers. The extension from prime numbers to single prime powers is also studied. Prime number septets at equal distance are given. It is also shown that each…

We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…

In this article I present results from a statistical study of prime numbers that shows a behaviour that is not compatible with the thesis that they are distributed randomly. The analysis is based on studying two arithmetical progressions…

A k-composition of n is a sequence of length k of positive integers summing up to n. In this paper, we investigate the number of k-compositions of n satisfying two natural coprimality conditions. Namely, we first give an exact asymptotic…

This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…

In paper on a classification of Lehmer triples, Juricevic conjectured that there are infinitely many primes of special form. We disprove one of his conjectures and consider the other one.

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an upper bound for the total number of palindromic subwords in a…

In an attempt to create an algebraic framework for dual canonical bases and total positivity in semisimple groups, we initiate the study of a new class of commutative algebras.

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…