English
Related papers

Related papers: Some experiments with Ramanujan-Nagell type Diopha…

200 papers

Let $F_n$ denote the $n^{th}$ term of the Fibonacci sequence. In this paper, we investigate the Diophantine equation $F_1^p+2F_2^p+\cdots+kF_{k}^p=F_{n}^q$ in the positive integers $k$ and $n$, where $p$ and $q$ are given positive integers.…

Number Theory · Mathematics 2021-04-01 Gökhan Soydan , László Németh , László Szalay

Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…

Number Theory · Mathematics 2011-08-02 J. C. Lagarias

We study the exponential Diophantine equation $x^2+p^mq^n=2y^p$ in positive integers $x,y,m,n$, and odd primes $p$ and $q$ using primitive divisors of Lehmer sequences in combination with elementary number theory. We discuss the solvability…

Number Theory · Mathematics 2023-08-25 Kalyan Chakraborty , Azizul Hoque

Let $K= \mathbf{Q}(\sqrt{d})$ be a quadratic field and $\mathcal{O}_{K}$ be its ring of integers. We study the solvability of the Diophantine equation $r + s + t = rst = 2$ in $\mathcal{O}_{K}$. We prove that except for $d= -7, -1, 17$ and…

Number Theory · Mathematics 2022-05-31 Richa Sharma

This article is devoted to the number of non-negative solutions of the linear Diophantine equation $$ a_1t_1+a_2t_2+... a_nt_n=d, $$ where $a_1, ..., a_n$, and $d$ are positive integers. We obtain a relation between the number of solutions…

Combinatorics · Mathematics 2010-12-15 Mohammad Shahryari

In this paper we examine the diophantine equation $x^k-y^k=x-y$ where $k$ is a positive integer $\geq 2$, and consider its applications. While the complete solution of the equation $x^k-y^k=x-y$ in positive rational numbers is already known…

Number Theory · Mathematics 2016-03-22 Ajai Choudhry , Jarosław Wróblewski

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

Let $k$ be a positive integer, and let $a,b$ be coprime positive integers with $\min\{a,b\}>1$. In this paper, using a combination of some elementary number theory techniques with classical results on the Nagell-Ljunggren equation, the…

Number Theory · Mathematics 2023-08-24 Maohua Le , Gökhan Soydan

In this paper, we consider the following nonlinear elliptic equation with gradient term: \[ \left\{ \begin{gathered} - \Delta u - \frac{1}{2}(x \cdot \nabla u) + (\lambda a(x)+b(x))u = \beta u^q +u^{2^*-1}, \hfill 0<u \in…

Analysis of PDEs · Mathematics 2023-12-06 Fei Fang , Zhong Tan , Huiru Xiong

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$--generalized Lucas numbers for some fixed integer $k\ge 2$ whose first $k$ terms are $0,\ldots,0,2,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we…

Number Theory · Mathematics 2024-12-18 Herbert Batte , Florian Luca

We deal with the problem to find the number $P(b)$ of integer non-negative solutions of an equation $\sum_{i=1}^{n} a_i x_i=b$, where $a_1,a_2,...,a_n$ are natural numbers and $b$ is a non-negative integer. As different from the traditional…

Number Theory · Mathematics 2021-08-11 Eteri Samsonadze

The Diophantine equation $A^4+hB^4=C^4+hD^4$, where $h$ is a fixed arbitrary positive integer, has been investigated by some authors. Currently, by computer search, the integer solutions of this equation are known for all positive integer…

Number Theory · Mathematics 2017-02-23 Farzali Izadi , Mehdi Baghalagdam

The title equation is completely solved in integers $(n,x,y,a,b)$, where $n\geq 3$, $\gcd(x,y)=1$ and $a,b\geq 0$. The most difficult stage of the resolution is the explicit resolution of a quintic Thue-Mahler equation. Since it is for the…

Number Theory · Mathematics 2017-03-16 Gökhan Soydan , Nikos Tzanakis

We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y+1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.

Number Theory · Mathematics 2009-09-29 J. Brzezinski , W. Holsztynski , P. Kurlberg

In the following we consider Diophantine equations of the form $x^2+ zxy + y^2 = M$ for given $M,z \in \mathbb{Z}$ and discuss the number of its (primitive) solutions as well as the construction of them. To reach this goal we introduce…

Number Theory · Mathematics 2024-11-04 Chris Busenhart

Let $c$ be a square-free positive integer and $p$ a prime satisfying $p\nmid c$. Let $h(-c)$ denote the class number of the imaginary quadratic field $\mathbb{Q}(\sqrt{-c})$. In this paper, we consider the Diophantine equation…

Number Theory · Mathematics 2021-02-17 Kalyan Chakraborty , Azizul Hoque , Kotyada Srinivas

Let $F \in \mathbb Z[x, y]$ be an irreducible binary form of degree $d \geq 7$ and content one. Let $\alpha$ be a root of $F(x, 1)$ and assume that the field extension $\mathbb Q(\alpha)/\mathbb Q$ is Galois. We prove that, for every…

Number Theory · Mathematics 2022-06-29 Anton Mosunov

Let $\bar{X}_{n}=(x_{1},\ldots,x_{n})$ and $\sigma_{i}(\bar{X}_{n})=\sum x_{k_{1}}\ldots x_{k_{i}}$ be $i$-th elementary symmetric polynomial. In this note we prove that there are infinitely many triples of integers $a, b, c$ such that for…

Number Theory · Mathematics 2013-05-28 Maciej Ulas

We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…

Number Theory · Mathematics 2007-05-23 J. -H. Evertse , P. Moree , C. L. Stewart , R. Tijdeman

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say…

Number Theory · Mathematics 2007-05-23 Jeffrey Lin Thunder
‹ Prev 1 8 9 10 Next ›