中文
相关论文

相关论文: Non-trivial Solutions of $Aa^p+Bb^p=Cc^3$ over Num…

200 篇论文

Using the modular method, we study solutions to the Diophantine equation $$Aa^p+Bb^p=Cc^2$$ over number fields. We first prove an asymptotic result for general number fields satisfying an appropriate $S$-unit condition by assuming some…

数论 · 数学 2026-02-24 Begum Gulsah Cakti , Erman Isik , Yasemin Kara , Ekin Ozman

In this paper, we prove results about solutions of the Diophantine equation $x^p+y^p=z^3$ over various number fields using the modular method. Firstly, by assuming some standard modularity conjecture we prove an asymptotic result for…

数论 · 数学 2022-03-10 Erman Isik , Yasemin Kara , Ekin Ozman

To give a parametrization of the Diophantine equation $A^{3}+B^{3}=C^{3}+D^{3}$ in terms of integral binary quadratic forms in a constructive way.

历史与综述 · 数学 2021-02-22 Dom Fosse

This paper applies the modular approach to obtain effectively computable bounds for Fermat-type equations over number fields, while also discussing the differences and obstructions that arise when considering such equations over totally…

数论 · 数学 2026-02-25 Begum Gulsah Cakti

In this article, we study the solutions of certain type over $K$ of the Diophantine equation $x^2= By^p+Cz^p$ with prime exponent $p$, where $B$ is an odd integer and $C$ is either an odd integer or $C=2^r$ for $r \in \mathbb{N}$. Further,…

数论 · 数学 2024-11-18 Narasimha Kumar , Satyabrat Sahoo

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

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

In this paper, we sharpen earlier work of the first author, Luca and Mulholland, showing that the Diophantine equation $$ A^3+B^3 = q^\alpha C^p, \, \, ABC \neq 0, \, \, \gcd (A,B) =1, $$ has, for "most" primes $q$ and suitably large prime…

数论 · 数学 2017-02-28 Michael A. Bennett , Carmen Bruni , Nuno Freitas

Recent results of Freitas, Kraus, Sengun and Siksek give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over various number fields. In this paper, we prove asymptotic results about the solutions of the Diophantine…

数论 · 数学 2023-11-22 Erman Isik

Let $p$ be a prime integer, $\mathbb{Z}_p$ the finite field of order $p$ and $\mathbb{Z}^{*}_{p}$ is its multiplicative cyclic group. We consider the Diophantine equation $x^n + y^n = z^n$ with $1 \leq n \leq \frac{p - 1}{2}$. Our main aim…

数论 · 数学 2020-01-10 Silvia R. Valdes , Yelena Shvets

This paper investigates the exponential Diophantine equation of the form $a^x+b=c^y$, where $a, b, c$ are given positive integers with $a,c \ge 2$, and $x,y$ are positive integer unknowns. We define this form as a "Type-I transcendental…

数论 · 数学 2025-10-15 Zeyu Cai

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 $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois representations for approaching…

数论 · 数学 2010-02-02 Sander R. Dahmen

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this…

数论 · 数学 2015-05-13 Mihai Cipu , Maurice Mignotte

Let $K$ be a number field. Using the modular method, we prove asymptotic results on solutions of the Diophantine equation $x^4-y^2=z^p$ over $K$, assuming some deep but standard conjectures of the Langlands programme when $K$ has at least…

数论 · 数学 2022-09-20 Lucas Villagra Torcomian

We solve the diophantine equations x^4 + d y^2 = z^p for d=2 and d=3 and any prime p>349 and p>131 respectively. The method consists in generalizing the ideas applied by Frey, Ribet and Wiles in the solution of Fermat's Last Theorem, and by…

数论 · 数学 2008-04-14 Luis Dieulefait , Jorge Jimenez Urroz

In this paper we find non-negative integer solutions for exponential Diophantine equations of the type $p \cdot 3^x+ p^y=z^2,$ where $p$ is a prime number. We prove that such equation has a unique solution…

数论 · 数学 2023-08-22 A. L. P. Porto , M. Buosi , G. S. Ferreira

We give criteria of the solvability of the diophantine equation $p=x^2+ny^2$ over some imaginary quadratic fields where $p$ is a prime element. The criteria becomes quite simple in special cases.

数论 · 数学 2015-01-12 Chang Lv , Yingpu Deng

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

A nontrivial solution of the equation A!B! = C! is a triple of positive integers (A, B, C) with A $\le$ B $\le$ C -- 2. It is conjectured that the only nontrivial solution is (6, 7, 10), and this conjecture has been checked up to C = 10 6.…

数论 · 数学 2023-03-27 Laurent Habsieger
‹ 上一页 1 2 3 10 下一页 ›