中文
相关论文

相关论文: On Diophantine Equation $x^2 = 2y^4-1$

200 篇论文

In this paper, we give a specific way of describing positive integer solutions of a Diophantine equation $(x+y)^2+(y+z)^2+(z+x)^2=12xyz$ and introduce a generalized cluster pattern behind it.

数论 · 数学 2022-09-20 Yasuaki Gyoda

Let $k,\ell\geq2$ be fixed integers and $C$ be an effectively computable constant depending only on $k$ and $\ell$. In this paper, we prove that all solutions of the equation $(x+1)^{k}+(x+2)^{k}+...+(\ell x)^{k}=y^{n}$ in integers $x,y,n$…

数论 · 数学 2019-09-16 Daniele Bartoli , Gökhan Soydan

We survey classical and recent results on exponents of Diophantine approximation. We give only a few proofs and highlight several open problems.

数论 · 数学 2015-02-11 Yann Bugeaud

We consider Diophantine equations of the shape $ f(x) = g(y) $, where the polynomials $ f $ and $ g $ are elements of power sums. Using a finiteness criterion of Bilu and Tichy, we will prove that under suitable assumptions infinitely many…

数论 · 数学 2023-04-12 Clemens Fuchs , Sebastian Heintze

Motivated by questions in cryptography, we look for diophantine equations that are hard to solve but for which determining the number of solutions is easy.

数论 · 数学 2020-06-09 Jose Felipe Voloch

This paper gives parametric solutions to quartic equations of the type,(4-3-3),(4-4-4),(4-5-5) and (4-6-6), According to Lander, Parkin, and Selfridge (2) conjecture, there are non-trivial solutions of the quartic…

综合数学 · 数学 2022-06-16 Seiji Tomita , Oliver Couto

By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.

数论 · 数学 2018-02-06 Yong Zhang

In 2012, T. Miyazaki and A. Togb\'{e} gave all of the solutions of the Diophantine equations $(2am-1)^x+(2m)^y=(2am+1)^z$ and $b^x+2^y=(b+2)^z$ in positive integers $x,y,z,$ $a>1$ and $b\ge 5$ odd. In this paper, we propose a similar…

数论 · 数学 2021-05-24 Elif Kızıldere , Gökhan Soydan , Qing Han , Pingzhi Yuan

We give solutions of a Diophantine equation containing factorials, which can be written as a cubic form, or as a sum of binomial coefficients. We also give some solutions to higher degree forms and relate some solutions to an unsolvable…

数论 · 数学 2015-10-19 Geoffrey B. Campbell , Aleksander Zujev

For fixed integers $D \geq 0$ and $c \geq 3$, we demonstrate how to use $2$-adic valuation trees of sequences to analyze Diophantine equations of the form $x^2+D=2^cy$ and $x^3+D=2^cy$, for $y$ odd. Further, we show for what values $D \in…

We study some Diophantine problems related to triangles with two given integral sides. We solve two problems posed by Zolt\'an Bertalan and we also provide some generalization.

数论 · 数学 2007-07-05 Szabolcs Tengely

In this paper we deal with a non-linear Diophantine equation which arises from the determinant computation of an integer matrix. We show how to find a solution, when it exists. We define an equivalence relation and show how the set of all…

数论 · 数学 2017-07-25 Massimo Salvi

In this article, we study the non-trivial primitive solutions of a certain type for the Diophantine equations $x^p+y^p=2^rz^p$ and $x^p+y^p=z^2$ of prime exponent $p$, $r \in \mathbb{N}$, over a totally real field $K$. Then for $r=2,3$, we…

数论 · 数学 2024-04-25 Narasimha Kumar , Satyabrat Sahoo

Ramanujan found five solutions to the exponential Diophantine equation $z^2+7= 2^n$ where $z$ and $n$ are positive integers, and posed the problem of determining whether there are any more. Nagell was the first to prove that there were not.…

综合数学 · 数学 2026-02-09 Philip Gibbs

In this paper we show that, for any fixed $1<c<967/805$, every sufficiently large positive number $N$ and a small constant $\varepsilon>0$, the diophantine inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\varepsilon \end{equation*}…

数论 · 数学 2023-11-28 S. I. Dimitrov

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

数论 · 数学 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

Diophantine equations are multivariate equations, usually polynomial, in which only integer solutions are admitted. A brute force method for finding solutions would be to systematically substitute possible integer solutions and check for…

数论 · 数学 2024-08-22 Lara Tatli , Paul Stevenson

Building on the works of Mordell (1952) and Schinzel (2015), we prove that cubic diophantine equations $xyz=G(x,y)$ have infinitely many solutions.

数论 · 数学 2024-12-17 János Kollár , Jennifer Li

In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the…

数论 · 数学 2025-06-05 Sebastian Heintze , Volker Ziegler

Diophantine equations are a popular and active area of research in number theory. In this paper we consider Mordell equations, which are of the form $y^2=x^3+d$, where $d$ is a (given) nonzero integer number and all solutions in integers…

计算机科学中的逻辑 · 计算机科学 2022-12-26 Anne Baanen , Alex J. Best , Nirvana Coppola , Sander R. Dahmen