相关论文: On the sparsity of integers $a$ in solutions to $a…

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical…

A nontrivial solution of the equation A!B! = C! is a triple of positive integers (A, B, C) with A $\le$ B $\le$ C -- 2. It is conjectured that the only nontrivial solution is (6, 7, 10), and this conjecture has been checked up to C = 10 6.…

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Erd\"os and Obl\'ath proved that the equation $n!\pm m!=x^p$ has only finitely many integer solutions. More general, under the ABC-conjecture, Luca showed that $P(x)=An!+Bm!$ has finitely many integer solutions for polynomials of degree…

The paper shows that the asymptotic density of solutions of Diophantine equations or systems of the natural numbers is 0. The author provides estimation methods and estimates number, density and probability of k- tuples $<x_1,...x_k>$ to be…

This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p…

In this note, we look at the diophantine equation $$ \prod_{i=1}^ta_i!=\prod_{j=1}^sn_i!, \quad n_1\geq \cdots \geq n_s\geq 2 \quad \textnormal{and}\quad n_1>a_1\geq a_2\geq\cdots \geq a_t\geq2. $$ \noindent Let $s<t$. Under the (explicit)…

We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…

Given any irrational number $\alpha$, we show that for any $0<\theta<6/17$, there are infinitely many $y$-smooth (friable) numbers $n$ such that $$\|n\alpha\| < n^{-\theta},$$ where $(\log n)^C\leq y\leq n$ for some large constant $C>0$.…

We consider the integro-differential equation ${\rm I}^{\alpha}_{0+}f= x^m f$ on the half-line. We show that there exists a density solution, which is then unique and can be expressed in terms of the Beta distribution, if and only if $m>…

Erd\H{o}s conjectured that for any set $A\subseteq \mathbb{N}$ with positive lower asymptotic density, there are infinite sets $B,C\subseteq \mathbb{N}$ such that $B+C\subseteq A$. We verify Erd\H{o}s' conjecture in the case that $A$ has…

Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the…

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

We are motivated by a result of Alzer and Luca who presented all the integer solutions to the relations $(k!)^n-k^n=(n!)^k-n^k$ and $(k!)^n+k^n=(n!)^k+n^k$. We modify the equations by considering the double factorial instead and present all…

We consider the number of solutions in positive integers $(x,y,z)$ for the purely exponential Diophantine equation $a^x+b^y =c^z$ (with $\gcd(a,b)=1$). Apart from a list of known exceptions, a conjecture published in 2016 claims that this…

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

F. Luca proved for any fixed rational number $\alpha>0$ that the Diophantine equations of the form $\alpha\,m!=f(n!)$, where $f$ is either the Euler function or the divisor sum function or the function counting the number of divisors, have…

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…