中文
相关论文

相关论文: Number of solutions to a special type of unit equa…

200 篇论文

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

数论 · 数学 2025-04-15 Takafumi Miyazaki , István Pink

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

数论 · 数学 2026-04-22 Takafumi Miyazaki , Reese Scott , Robert Styer

For any fixed coprime positive integers $a,b$ and $c$ with $\min\{a,b,c\}>1$, we prove that the equation $a^x+b^y=c^z$ has at most two solutions in positive integers $x,y$ and $z$, except for one specific case which exactly gives three…

数论 · 数学 2020-08-20 Takafumi Miyazaki , István Pink

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. In this…

数论 · 数学 2025-04-15 Maohua Le , Takafumi Miyazaki

Let $a$, $b$, $c$ be fixed coprime positive integers with $\min\{ a,b,c \} >1$. Let $N(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. We show that if $(a,b,c)$ is a triple of distinct…

数论 · 数学 2022-07-15 Maohua Le , Reese Scott , Robert Styer

We consider the number of solutions in positive integers $(x,y,z)$ for the purely exponential Diophantine equation $a^x+b^y =c^z$ (with $\gcd(a,b)=1$). Apart from a list of known exceptions, a conjecture published in 2016 claims that this…

数论 · 数学 2024-02-08 Robert Styer

We show that there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x+b^y=c^z$ for positive integers $a$, $b$, and $c$ all greater than one, with just one exceptional case when $\gcd(a,b)=1$, and just one…

数论 · 数学 2024-12-25 Reese Scott , Robert Styer

We consider a variant of the ABC Conjecture, attempting to count the number of solutions to $A+B+C=0$, in relatively prime integers $A,B,C$ each of absolute value less than $N$ with $r(A)<|A|^a, r(B)<|B|^b, r(C)<|C|^c.$ The ABC Conjecture…

数论 · 数学 2014-09-17 Daniel M. Kane

Let $a$, $b$, $c$ be distinct primes with $a<b$. Let $S(a,b,c)$ denote the number of positive integer solutions $(x,y,z)$ of the equation $a^x + b^y = c^z$. In a previous paper \cite{LeSt} it was shown that if $(a,b,c)$ is a triple of…

数论 · 数学 2023-07-11 Maohua Le , Reese Scott , Robert Styer

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

For relatively prime integers $a$ and $b$ both greater than one and odd integer $c$, there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x + b^y = c^z$. There are an infinite number of $(a,b,c)$ giving exactly…

数论 · 数学 2023-07-11 Reese Scott , Robert Styer

The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…

数论 · 数学 2020-05-18 P. A. CrowdMath

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…

数论 · 数学 2009-04-14 Constantin M. Petridi

For $p$ and $q$ any two distinct Fermat or Mersenne primes, $m,n,r$ as positive integers and $\mu = \pm 1$ satisfying any diophantine relation, $\mbox{(i)}\; 2^m + \mu = p^nq^r, \mbox{(ii)} \; 2^mp^n + \mu = q^r \mbox{ or } \mbox{(iii)} \;…

数论 · 数学 2025-11-27 Anupam Saxena

Let $a,b,c$ be relatively prime positive integers such that $a^{2}+b^{2}=c^{2}.$ In 1956, Je\'{s}manowicz conjectured that for any positive integer $n$, the only solution of $(an)^{x}+(bn)^{y}=(cn)^{z}$ in positive integers is…

数论 · 数学 2013-10-24 Min Tang , Jian-Xin Weng

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

数论 · 数学 2011-07-11 Jeffrey C. Lagarias , K. Soundararajan

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

数论 · 数学 2007-05-23 Constantin M. Petridi

Let ${\rm rad}(n)$ denote the product of distinct prime factors of an integer $n\geq 1$. The celebrated $abc$ conjecture asks whether every solution to the equation $a+b=c$ in triples of coprime integers $(a,b,c)$ must satisfy ${\rm…

数论 · 数学 2025-05-21 Jared Duker Lichtman

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

The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…

数论 · 数学 2017-03-14 Livio Colussi
‹ 上一页 1 2 3 10 下一页 ›