中文
相关论文

相关论文: Some Rational Diophantine Sextuples

200 篇论文

The number of solutions of the diophantine equation $\sum_{i=1}^k \frac{1}{x_i}=1,$ in particular when the $x_i$ are distinct odd positive integers is investigated. The number of solutions $S(k)$ in this case is, for odd $k$: \[\exp \left(…

数论 · 数学 2016-06-08 Christian Elsholtz

We consider Diophantine quintuples $\{a, b, c, d, e\}$, sets of distinct positive integers the product of any two elements of which is one less than a perfect square. Triples of the first kind are the subsets $\{a, b, d\}$ with $d> b^{5}$.…

数论 · 数学 2015-02-27 Dave Platt , Tim Trudgian

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…

数论 · 数学 2020-10-12 Andrej Dujella , Vinko Petričević

We wish to discuss positive integer solutions to the Diophantine equation $$\prod_{k=1}^n(k^2+1)=b^2.$$ Some methods in analytic number theory will be used to tackle this problem.

数论 · 数学 2024-11-26 Thang Pang Ern

We study the possible structure of the groups of rational points on elliptic curves of the form y^2=(ax+1)(bx+1)(cx+1), where a,b,c are non-zero rationals such that the product of any two of them is one less than a square.

数论 · 数学 2021-08-30 Andrej Dujella

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

By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule-them-all' equations: proving that one of them has only a…

数论 · 数学 2024-10-01 Domenico Cantone , Luca Cuzziol , Eugenio G. Omodeo

We propose an approach for showing rationality of an algebraic variety $X$. We try to cover $X$ by rational curves of certain type and count how many curves pass through a generic point. If the answer is $1$, then we can sometimes reduce…

代数几何 · 数学 2018-12-11 Anton Mellit

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…

数论 · 数学 2016-03-22 Ajai Choudhry , Jarosław Wróblewski

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

数论 · 数学 2010-03-17 Michael Stoll

Motivated by the theory of Diophantine $m$-tuples, we study rational points on quadratic twists $H^d:d y^2=(x^2+6x-18)(-x^2+2x+2)$, where $|d|$ is a prime. If we denote by $S(X)=\{ d \in \mathbb{Z}: H^d(\mathbb{Q})\ne \emptyset, |d|…

数论 · 数学 2022-09-27 Matija Kazalicki

We show that for any irrational $\alpha$ and any $\tau<8/23$ there are infinitely many $n$ which are the product of two primes for which $$\|n\alpha\|\leq n^{-\tau}.$$ We also show that for all sufficiently large $b$ there exist 3-digit…

数论 · 数学 2014-09-09 A. J. Irving

By the theory of elliptic curves, we study the nontrivial rational parametric solutions and rational solutions of the Diophantine equations $z^2=f(x)^2 \pm f(y)^2$ for some simple Laurent polynomials $f$.

数论 · 数学 2018-02-06 Yong Zhang , Arman Shamsi Zargar

A rational spherical triangle is a triangle on the unit sphere such that the lengths of its three sides and its area are rational multiples of $\pi$. Little and Coxeter have given examples of rational spherical triangles in 1980s. In this…

数论 · 数学 2023-12-05 Haiyang Wang

Science and mathematics help people better to understand world, eliminating different fallacies and misconceptions. One of such misconception is related to arithmetic, which is so important both for science and everyday life. People think…

综合数学 · 数学 2007-05-23 Mark Burgin

A recursive algorithm is constructed which finds all solutions to a class of Diophantine equations connected to the problem of determining ordered n-tuples of positive integers satisfying the property that their sum is equal to their…

离散数学 · 计算机科学 2013-11-18 M. A. Nyblom , C. D. Evans

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…

数论 · 数学 2017-05-08 C. P. Anil Kumar

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

Two well-studied Diophantine equations are those of Pythagorean triples and elliptic curves; for the first, we have a parametrization through rational points on the unit circle, and for the second we have a structure theorem for the group…

A Diophantine $m$-tuple is a set $A$ of $m$ positive integers such that $ab+1$ is a perfect square for every pair $a,b$ of distinct elements of $A$. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are…

数论 · 数学 2014-01-14 Greg Martin , Scott Sitar