中文
相关论文

相关论文: On Diophantine quintuple Conjecture

200 篇论文

The main idea of this article is simply calculating integer functions in module. The algebraic in the integer modules is studied in completely new style. By a careful construction, a result is proven that two finite numbers is with unequal…

综合数学 · 数学 2021-01-08 Sheng-Ping Wu

For a nonzero integer $n$, a set of $m$ distinct nonzero integers $\{a_1,a_2,...,a_m\}$ such that $a_ia_j+n$ is a perfect square for all $1 \leq i < j \leq m$, is called a $D(n)$-$m$-tuple. In this paper, we show that there infinitely many…

数论 · 数学 2019-12-30 Andrej Dujella , Vinko Petričević

In this paper we extend a result of Hirata-Kohno, Laishram, Shorey and Tijdeman on the Diophantine equation $n(n+d)...(n+(k-1)d)=by^2,$ where $n,d,k\geq 2$ and $y$ are positive integers such that $\gcd(n,d)=1.$

数论 · 数学 2015-05-13 Szabolcs Tengely

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…

数论 · 数学 2026-04-07 Stephan Baier , Sayantan Roy

A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are…

In this article we establish two new results on quantitative Diophantine approximation for one-parameter families of diagonal ternary indefinite forms. In the first result, we consider quadratic forms taking values at prime points. In the…

数论 · 数学 2023-11-20 Anish Ghosh , V. Vinay Kumaraswamy

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…

数论 · 数学 2025-03-14 Bogdan A. Dobrescu , Patrick J. Fox

The paper is devoted to the problem of estimating the constant of the best Diophantine approximations. The estimates of lower bound $ C_n $ for $ n = 5 $ and $ n = 6 $ was improved. The first chapter gives an overview of the history of…

数论 · 数学 2019-04-10 Yurij Basalov

We give a survey on some results covering the last 60 years concerning Je\'smanowicz' conjecture. Moreover, we conclude the survey with a new result by showing that the special Diophantine equation $$(20k)^x+(99k)^y=(101k)^z$$ has no…

数论 · 数学 2017-06-20 Gökhan Soydan , Musa Demirci , Ismail Naci Cangul , Alain Togbé

We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for $1<k<4/3$. We improve the $k$-range to $1<k\le 3$ by combining Harman's…

Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…

数论 · 数学 2024-10-29 Gergő Batta , Lajos Hajdu , András Pongrácz

Given a finite set of primes $S$ and a $m$-tuple $(a_1,\dots,a_m)$ of positive, distinct integers we call the $m$-tuple $S$-Diophantine, if for each $1\leq i < j\leq m$ the quantity $a_ia_j+1$ has prime divisors coming only from the set…

数论 · 数学 2020-10-23 Volker Ziegler

This paper is a continuation of [1], in which I studied Harvey Friedman's problem of whether the function f(x,y) = x^2 + y^3 satisfies any identities; however, no knowledge of [1] is necessary to understand this paper. We will break the…

综合数学 · 数学 2009-10-13 Roger Tian

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

数论 · 数学 2026-05-28 Vikas Godara , Divyum Sharma

Diophantine triples taking values in recurrence sequences have recently been studied quite a lot. In particular the question was raised whether or not there are finitely many Diophantine triples in the Tribonacci sequence. We answer this…

In this paper we determine the perfect powers that are sums of three fifth powers in an arithmetic progression. More precisely, we completely solve the Diophantine equation $$ (x-d)^5 + x^5 + (x + d)^5 = z^n,~n\geq 2, $$ where $d,x,z \in…

Let $\Theta = (\theta_1,\theta_2,\theta_3)\in \mathbb{R}^3$. Suppose that $1,\theta_1,\theta_2,\theta_3$ are linearly independent over $\mathbb{Z}$. For Diophantine exponents $$ \alpha(\Theta) = \sup \{\gamma >0:\,\,\, \limsup_{t\to…

数论 · 数学 2010-12-09 Nikolay Moshchevitin

Let $d$ be a square-free integer and $\mathbb{Z}[\sqrt{d}]$ a quadratic ring of integers. For a given $n\in\mathbb{Z}[\sqrt{d}]$, a set of $m$ non-zero distinct elements in $\mathbb{Z}[\sqrt{d}]$ is called a Diophantine $D(n)$-$m$-tuple (or…

数论 · 数学 2024-06-27 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

Let $g\ge 2$ be an integer and $\mathcal R_g\subset \mathbb N$ be the set of repdigits in base $g$. Let $\mathcal D_g$ be the set of Diophantine triples with values in $\mathcal R_g$; that is, $\mathcal D_g$ is the set of all triples…

数论 · 数学 2015-08-31 Attila Bérczes , Florian Luca , István Pink , Volker Ziegler

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…

数论 · 数学 2013-05-28 Maciej Ulas