Related papers: Resolution of Erd\H{o}s' problems about unimodular…

The law of large numbers for the empirical density for the pairs of uniformly distributed integers with a given greatest common divisor is a classic result in number theory. In this paper, we study the large deviations of the empirical…

For a fixed rational number g and integers a and d the sets N_g(a,d), respectively R_g(a,d), of primes p for which the order, respectively the index of g(mod p) is congruent to a(mod d), are considered. Under the Generalized Riemann…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

In this paper it is shown that if $\mu$ is an n-dimensional Ahlfors-David regular measure in $R^d$ which satisfies the so-called weak constant density condition, then $\mu$ is uniformly rectifiable. This had already been proved by David and…

We show that for large integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the number of prime factors follows an approximate normal distribution, with mean $C \log_2 n$ and variance $V \log_2 n$,…

The $(k,i)$-singular overpartitions, combinatorial objects introduced by Andrews in 2015, are known to satisfy Ramanujan-type congruences modulo any power of prime coprime to $6k$. In this paper we consider the parity of the number…

Suppose l=2m+1, m>0. We introduce m "theta-series", [1],...,[m], in Z/2[[x]]. It has been conjectured that the n for which the coefficient of x^n in 1/[i] is 1 form a set of density 0. This is probably always false, but in certain cases,…

In this paper, we compute the natural density of the set of k x n integer matrices that can be extended to an invertible n x n matrix over the integers. As a corollary, we find the density of rectangular matrices with Hermite normal form [O…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

In this paper, we show that various kinds of integer polynomials with prescribed properties of their roots have positive density. For example, we prove that almost all integer polynomials have exactly one or two roots with maximal modulus.…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

In this paper, we develop Furstenberg's proof of infinity of primes, and prove several results about prime divisors of sequences of integers, including the celebrated Schur's theorem. In particular, we give a simple proof of a classical…

This paper investigates the dynamics of the iterated sum-of-divisors function $\sigma_k(m)$ and its behaviour modulo $m$, motivated by classical questions on perfect and multiperfect numbers and by the congruences $\sigma_k(m) \equiv 0…

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Let $\mathbf{D}=(D_{n})_{n\geq 1}$ be an elliptic divisibility sequence associated to the pair $(E,P)$. For a fixed integer $k$, we define $\mathscr{A}_{E,k}=\{n\geq 1 : \gcd(n,D_{n})=k\}$. We give an explicit structural description of…

We prove an Andr\'e--Oort-type result for a family of hypersurfaces in $\mathbb{C}^n$ that is both uniform and effective. Let $K_*$ denote the single exceptional imaginary quadratic field which occurs in the Siegel--Tatuzawa lower bound for…

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

We establish the order of the maximum length of an increasing sequence, bounded by $n$, in which the largest prime divisor of the elements form a decreasing sequence.

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as the sum of non-consecutive Fibonacci numbers $\{ F_i \}_{i = 1}^{\infty}$. A set $S \subset \mathbb{Z}$ is said to satisfy Benford's law if the density…