English
Related papers

Related papers: On the congruence ax+by = 1 modulo xy

200 papers

For every positive integer $n$, an infinite family of positive integral solutions of the diophantine equation $x^n - y^n = z^{n+1}$ is constructed.

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

In this article, we consider the equation x^2+19^{m}=y^n, n>2, m>0. We find the solutions of the title equation for not only 2 \mid m but also 2\notdividesm.

Number Theory · Mathematics 2012-02-03 Bilge Peker , Selin , Cenberci

In this paper, we give all the solutions of the Diophantine equation x^2+7^{alpha}.11^{beta}=y^n, in nonnegative integers x, y, n>=3 with x and y coprime, except for the case when alpha.x is odd and beta is even.

Number Theory · Mathematics 2012-01-05 Gokhan Soydan

We study solvability of the Diophantine equation \begin{equation*} \frac{n}{2^{n}}=\sum_{i=1}^{k}\frac{a_{i}}{2^{a_{i}}}, \end{equation*} in integers $n, k, a_{1},\ldots, a_{k}$ satisfying the conditions $k\geq 2$ and $a_{i}<a_{i+1}$ for…

Number Theory · Mathematics 2021-02-11 Szabolcs Tengely , Maciej Ulas , Jakub Zygadło

Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…

Number Theory · Mathematics 2023-01-19 Avraham Bourla

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

Number Theory · Mathematics 2022-04-19 Hung M. Bui , Kyle Pratt , Alexandru Zaharescu

We give upper and lower bounds for the number of solutions of the equation $p(z)\log|z|+q(z)=0$ with polynomials $p$ and $q$.

Complex Variables · Mathematics 2018-09-14 Walter Bergweiler , Alexandre Eremenko

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

Number Theory · Mathematics 2026-04-07 Stephan Baier , Sayantan Roy

In this paper, we find all solutions of the exponential Diophantine equation $B_{n+1}^x-B_n^x=B_m$ in positive integer variables $(m, n, x)$, where $B_k$ is the $k$-th term of the Balancing sequence.

Number Theory · Mathematics 2018-11-08 Salah E. Rihane , Bernadette Faye , Florian Luca , Alain Togbe

Let p, c be distinct odd primes, and l \ge 2 an integer. We find sufficient conditions for the Diophantine equation cy^l=(x^p-1)/(x-1) not to have integer solutions

Number Theory · Mathematics 2013-02-26 Mohammad Sadek

Let $\mathbb{F}_q$ be a finite field with $q=p^t$ elements. In this paper, we study the number of solutions of equations of the form $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$ over $\mathbb{F}_q$. A classic well-konwn result from Weil yields a…

Number Theory · Mathematics 2020-09-25 José Alves Oliveira

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

Number Theory · Mathematics 2013-07-03 Ernie Croot , Neil Lyall , Alex Rice

We consider equations of the form $a_{1}x_{1}^{k}+...+a_{s}x_{s}^{k}$ and when they have solutions in the primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove…

Number Theory · Mathematics 2026-05-14 Philippa Holdridge

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

Number Theory · Mathematics 2015-03-12 Igor E. Shparlinski

We solve Diophantine equations of the type $ a \, (x^3 \!+ \! y^3 \!+ \! z^3 ) = (x \! + \! y \! + \! z)^3$, where $x,y,z$ are integer variables, and the coefficient $a\neq 0$ is rational. We show that there are infinite families of such…

Number Theory · Mathematics 2025-03-14 Bogdan A. Dobrescu , Patrick J. Fox

Many special functions are solutions of first order linear systems $y_n'(x)=a_n(x)y_n(x)+d_n(x)y_{n-1}(x)$, $y_{n-1}'(x)=b_n(x)y_{n-1}(x)+e_{n}(x)y_n(x)$. We obtain bounds for the ratios $y_n(x)/y_{n-1}(x)$ and the logarithmic derivatives…

Classical Analysis and ODEs · Mathematics 2011-10-06 Javier Segura

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…

Number Theory · Mathematics 2017-07-04 Eshita Mazumdar , S. S. Rout

The sufficient conditions for solvability of a linear Diophantine equation $\sum_{i=1}^{n}a_ix_i=b$ (with $a_1,a_2,...,a_n\in \mathbb{N}$) in non-negative integers $x_1,x_2,...,x_n$ are given. The explicit formulas are given for Frobenius…

Number Theory · Mathematics 2026-02-13 Eteri Samsonadze

We consider some Diophantine problems of mixed modular-multiplicative type associated with the Zilber-Pink conjecture. In particular, we prove a finiteness statement for the number of multiplicative relations between singular moduli…

Number Theory · Mathematics 2014-12-30 Jonathan Pila , Jacob Tsimerman