相关论文: On covering numbers

In many simple integral domains, such as $\mathbb{Z}$ or $\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact…

A (positive definite and integral) quadratic form $f$ is said to be $\textit{universal}$ if it represents all positive integers, and is said to be $\textit{primitively universal}$ if it represents all positive integers primitively. We also…

A set of arithmetical sequences $$ a_1\, (\bmod{ \,\, m_1}) \quad, \quad a_2 \, (\bmod{\,\, m_2}) \quad, \quad \dots \quad , \quad a_k \, (\bmod{\,\,m_k}) \quad \quad , $$ with $$ m_1 \leq m_2 \leq \dots \leq m_k \quad \quad , $$ is called…

Let $A$ be an abelian variety defined over a number field $K$. We say that a point $P \in A(\overline{\mathbb{Q}})$ is primitive if there is no $Q \in A(\overline{\mathbb{Q}})$ defined on the field of definition of $P$ over $K$ such that…

In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus $m_{0}$ in a finite distinct covering system that would imply that the sum of the reciprocals of the moduli in the covering system is bounded away…

A nonnegative integer is called a fertility number if it is equal to the number of preimages of a permutation under West's stack-sorting map. We prove structural results concerning permutations, allowing us to deduce information about the…

Erd\H{o}s asked whether there are infinitely many finite sets of distinct primes $p_1<\cdots<p_k$ and positive integers $m$ such that \begin{equation}\label{eq:erdos-original} \frac1{p_1}+\cdots+\frac1{p_k}=1-\frac1m. \end{equation} This is…

For a prime power \( q \) and a positive integer \( n \), a subspace \( U \subseteq \mathbb{F}_q^n \) is called cyclically covering if the union of all its cyclic shifts covers the whole space \( \mathbb{F}_q^n \). Let \( h_q(n) \) denote…

Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.

For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…

In this paper it was shown that all prime numbers lie on 96 half-lines. At the same time, it was shown that if a given number does not lie on any of the above half-lines, then it is a composite number. A corresponding linear mathematical…

For a positive integer $n$, let $\sigma(n)$ denote the sum of the positive divisors of $n$. Let $d$ be a proper divisor of $n$. We call $n$ a deficient-perfect number if $\sigma(n)=2n-d$. In this paper, we show that the only odd…

We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

An integer $n$ is said to be ternary if it is composed of three distinct odd primes. In this paper, we asymptotically count the number of ternary integers $n \leq x$ with the constituent primes satisfying various constraints. We apply our…

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…

An positive even number is said to be a Kronecker number if it can be written in infinitely many ways as the difference between two primes, and it is believed that all even numbers are Kronecker numbers. We will study the division and…

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…

A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we…