Related papers: Diophantine approximation with integers having no …

A set A is square-difference free (henceforth SDF) if there do not exist x,y\in A, x\ne y, such that |x-y| is a square. Let sdf(n) be the size of the largest SDF subset of {1,...,n}. Ruzsa has shown that sdf(n) = \Omega(n^{0.5(1+ \log_{65}…

In 2004, J.C. Tong found bounds for the approximation quality of a regular continued fraction convergent of a rational number, expressed in bounds for both the previous and next approximation. We sharpen his results with a geometric method…

Let $[\,\cdot\,]$ denote the floor function. In this paper, we show that whenever $\eta$ is real and the constants $\lambda _i$ satisfy some necessary conditions, then for any fixed $\frac{63}{64}<\gamma<1$ and $\theta>0$, there exist…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

In the thirties of the last century, I. M. Vinogradov established uniform distribution modulo 1 of the sequence $p\alpha$ when $\alpha$ is a fixed irrational real number and $p$ runs over the primes. In particular, he showed that the…

In this paper, using a deep result on the existence of primitive divisors of Lehmer numbers due to Y. Bilu, G. Hanrot and P. M. Voutier, we first give an explicit formula for all positive integer solutions of the Diophantine equation…

In [10] the third author of this paper presented two conjectures on the additive decomposability of the sequence of ''smooth'' (or ''friable'') numbers. Elsholtz and Harper [4] proved (by using sieve methods) the second (less demanding)…

We show that the growth rate of denominator $Q_n$ of the $n$-th convergent of negative expansion of $x$ and the rate of approximation: $$ \frac{\log{n}}{n}\log{\left|x-\frac{P_n}{Q_n}\right|}\rightarrow -\frac{\pi^2}{3} \quad \text{in…

In the fall 2011 issue of the Journal'Mathematics and Computer Education', author Unal Hasan, in the one page article "Proof without Words", gives a purely geometric proof of the equality, arctan(1/3)+ arctan(1/7) = arctan(1/2) (1) (See…

The aim of this note is to show that given a positive integer $n \geq 5$, the positive integral solutions of the diophantine equation $4/n = 1/x + 1/y+1/z$ cannot have solution such that $x$ and $y$ are coprime with $xy < \sqrt{z/2}$. The…

The seminal work of Kurzweil (1955) provides for any fixed badly approximable $\alpha$ and monotonically decreasing $\psi$ a Khintchine-type statement on the set of the inhomogeneous real parameters $\gamma$ for which $\lVert n \alpha +…

We establish new inequalities involving classical exponents of Diophantine approximation. This allows for improving on the work of Davenport, Schmidt and Laurent concerning the maximum value of the exponent $\hat{\lambda}_{n}(\zeta)$ among…

The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=-…

We prove that if $\lambda_1$, $\lambda_2$, $\lambda_3$ and $\lambda_4$ are non-zero real numbers, not all of the same sign, $\lambda_1 / \lambda_2$ is irrational, and $\varpi$ is any real number then, for any $\eps > 0$ the inequality $…

Let $n$ be a non-zero integer. A set $S$ of positive integers is a Diophantine tuple with the property $D(n)$ if $ab+n$ is a perfect square for each $a,b \in S$ with $a \neq b$. It is of special interest to estimate the quantity $M_n$, the…

We investigate the solvability of the Diophantine equation in the title, where $d>1$ is a square-free integer, $p, q$ are distinct odd primes and $x,y,a,b$ are unknown positive integers with $\gcd(x,y)=1$. We describe all the integer…

We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…

How many ways can we write $n$ as a sum of $3$ positive integers, no pair of which share a common factor? We express this quantity in terms of the number of solutions to a certain class of linear Diophantine equations. This allows us to…

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…