中文
相关论文

相关论文: A Generalised Stern-Brocot Tree from Regular Dioph…

200 篇论文

A set of $m$ distinct nonzero rationals $\{a_1, a_2,\ldots, a_m\}$ such that $a_i a_j+1$ is a perfect square for all $1\le i <j \le m$, is called a rational Diophantine $m$-tuple. If in addition, $a_i^2+1$ is a perfect square for $1\le i\le…

数论 · 数学 2024-03-28 Andrej Dujella , Matija Kazalicki , Vinko Petričević

The problem of finding all possible extensions of a given rational diophantine quadruple to a rational diophantine quintuple is equivalent to the determination of the set of rational points on a certain curve of genus 5 that can be written…

数论 · 数学 2019-08-20 Michael Stoll

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

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

数论 · 数学 2026-04-03 Stephan Baier , Habibur Rahaman

The roots of -1 in the set of biquaternions (quaternions with complex components, or complex numbers with quaternion real and imaginary parts) are studied and it is shown that there is an infinite number of non-trivial complexified…

环与代数 · 数学 2007-05-23 Stephen J. Sangwine

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

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

数论 · 数学 2017-02-17 S. I. Dimitrov

A brief history and two formulations of the Diophantine problem's requirements are presented. One tier consisting of three two-parameter solutions is studied for its ability to provide examples for the small natural numbers considered.…

综合数学 · 数学 2025-04-08 Paul A. Roediger

For a rational number $q$, a rational $D(q)$-$n$-tuple is a set of $n$ distinct nonzero rationals $\{a_1, a_2, \dots, a_n\}$ such that $a_ia_j+q$ is a rational square for all $1 \leqslant i < j \leqslant n$. For every $q$ we find all…

数论 · 数学 2025-12-30 Goran Dražić , Matija Kazalicki

The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence…

数论 · 数学 2018-10-30 Clemens Fuchs , Christoph Hutle , Florian Luca

We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…

数论 · 数学 2007-05-23 Constantin M. Petridi , Peter B. Krikelis

Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…

数论 · 数学 2022-11-17 Konstantinos A. Draziotis

A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we…

数论 · 数学 2020-12-22 Andrej Dujella , Juan Carlos Peral

Let A,K be positive integers and u=-2,-1,1 or 2. The main contribution of the paper is a proof that each of the D(u^2)-triples {K,A^2K+2uA,(A+1)^2K+2u(A+1)} has unique extension to a D(u^2)-quadruple.

数论 · 数学 2016-11-29 Mihai Cipu , Yasutsugu Fujita , Maurice Mignotte

Inspired by the fact that the sum of the cubes of the first $n$ naturals is equal to the square of their sum, we explore, for each $n$, the Diophantine equation representing all non-trivial sets of $n$ integers with this property. We find…

数论 · 数学 2013-08-06 Edward Barbeau , Samer Seraj

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…

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

Diophantine subsets of $\mathbb{Z}$ play a key role in the negative answer to Hilbert's tenth problem. The definition of diophantine set generalizes in several ways to other commutative rings. We compare these definitions. Along the way, we…

数论 · 数学 2025-11-25 Bhargav Bhatt , Bjorn Poonen

We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…

数论 · 数学 2022-05-03 Peter Lynch , Michael Mackey

Let $\alpha$ and $\beta$ be real numbers such that $1$, $\alpha$ and $\beta$ are linearly independent over $\mathbb{Q}$. A classical result of Dirichlet asserts that there are infinitely many triples of integers $(x_0,x_1,x_2)$ such that…

数论 · 数学 2016-07-05 Damien Roy