相关论文: The Primary Pretenders

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the…

We find asymptotics for $S_{K,c}(x)$, the number of positive integers below $x$ whose number of prime factors is $c \; \mathrm{mod}\; K$. We study this question in the context of Beurling integers.

Let $h,k \ge 2$ be integers. A set $A$ of positive integers is called asymptotic basis of order $k$ if every large enough positive integer can be written as the sum of $k$ terms from $A$. A set of positive integers $A$ is said to be a…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac…

We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

This paper is an updated version of ANT-0372 (2002 dec 4) with the same title. Several errors are corrected in this version. An example of the kind of results obtained is: Let K/\Q be an abelian extension with N = [K:\Q] > 1, N odd. Let…

We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…

Let $p$ be a prime $\equiv 3$ mod 4, $p>3$, and suppose that 10 has the order $(p-1)/2$ mod p. Then $1/p$ has a decimal period of length $(p-1)/2$. We express the frequency of each digit $0,\ldots,9$ in this period in terms of the class…

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…

The purpose of this paper is to introduce the concept of reflecting numbers to the realm of number theory and to classify reflecting numbers of certain types. For us, reflecting numbers are coming from congruent numbers, above congruent…

When numbers are added in base $b$ in the usual way, carries occur. If two random, independent 1-digit numbers are added, then the probability of a carry is $\frac{b-1}{2b}$. Other choices of digits lead to less carries. In particular, if…

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…

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

Let $q$ be a sufficiently large integer, and $a_0\in\{0,\dots,q-1\}$. We show there are infinitely many prime numbers which do not have the digit $a_0$ in their base $q$ expansion. Similar results are obtained for values of a polynomial…

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…