arXiv subjects

István Pink

Publications and source records attributed to István Pink.

10 recordsLinked to original sources

arXiv2025

Number of solutions to a special type of unit equations in two unknowns, III

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 the methods in our previous work which rely on a variety from Baker's theory and thoroughly study the conjecture for cases where $c$ is small relative to $a$ or $b$. Using restrictions derived under which there is more than one solution to the equation, we obtain a number of finiteness results on the conjecture, which in particular enables us to find some new values of $c$ being presumably infinitely many such that for each such $c$ the conjecture holds true except for only finitely many pairs of $a$ and $b$. Most importantly we prove that if $c=13$ then the equation has at most one solution, except for $(a,b)=(3,10)$ or $(10,3)$ which exactly gives two solutions. Further our study with the help of Schmidt Subspace Theorem among others brings strong contributions to the study of Pillai's type Diophantine equations, which includes a general and satisfactory result on a well-known conjecture of M. Bennett on the equation $a^x-b^y=c$ for any fixed positive integers $a,b$ and $c$ with both $a$ and $b$ greater than 1. Some conditional results are presented under the $abc$-conjecture as well.

math.NT↗

arXiv2024

More on consecutive multiplicatively dependent triples of integers

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such triples in case $a=2$. Our techniques include a variety of elementary arguments together with more involved machinery from Diophantine approximation.

math.NT↗

arXiv2024

On the largest value of the solutions of Erdős's last equation

Let $n$ be a positive integer. The Diophantine equation $n(x_1+x_2+\dots +x_n)=x_1x_2\dots x_n$, $1 \le x_1\le x_2\le \dots \le x_n$ is called Erdős's last equation. We prove that $x_n\to \infty $ as $n\to \infty$ and determine all tuples $(n,x_1,\dots ,x_n)$ with $x_n\le 10$.

math.NT↗

arXiv2024

Number of solutions to a special type of unit equations in two unknowns, II

This paper contributes to the conjecture of R. Scott and R. Styer which asserts 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. The fundamental result proves the conjecture under some congruence condition modulo $c$ on $a$ and $b$. As applications the conjecture is confirmed to be true if $c$ takes some small values including the Fermat primes found so far, and in particular this provides an analytic proof of the celebrated theorem of Scott [R. Scott, On the equations $p^x-b^y=c$ and $a^x+b^y=c^z$, J. Number Theory 44(1993), no.2, 153-165] solving the conjecture for $c=2$ in a purely algebraic manner. The method can be generalized for smaller modulus cases, and it turns out that the conjecture holds true for infinitely many specific values of $c$ not being perfect powers. The main novelty is to apply a special type of the $p$-adic analogue to Baker's theory on linear forms in logarithms via a certain divisibility relation arising from the existence of two hypothetical solutions to the equation. The other tools include Baker's theory in the complex case and its non-Archimedean analogue for number fields together with various elementary arguments through rational and quadratic numbers, and extensive computation.

math.NT↗

arXiv2020

Number of solutions to a special type of unit equations in two variables

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 solutions. Our result is essentially sharp in the sense that there are infinitely many examples allowing the equation to have two solutions in positive integers. From the viewpoint of a well-known generalization of Fermat's equation, it is also regarded as a 3-variable generalization of the celebrated theorem of Bennett [M.A.Bennett, On some exponential equations of S.S.Pillai, Canad. J. Math. 53(2001), no.2, 897--922] which asserts that Pillai's type equation $a^x-b^y=c$ has at most two solutions in positive integers $x$ and $y$ for any fixed positive integers $a,b$ and $c$ with $\min\{a,b\}>1$.

math.NT↗

arXiv2017

On the Diophantine equation $(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}=y^n$

In this work, we give upper bounds for $n$ on the title equation. Our results depend on assertions describing the precise exponents of $2$ and $3$ appearing in the prime factorization of $T_{k}(x)=(x+1)^{k}+(x+2)^{k}+...+(2x)^{k}$. Further, on combining Baker's method with the explicit solution of polynomial exponential congruences (see e.g. BHMP), we show that for $2 \leq x \leq 13, k \geq 1, y \geq 2$ and $n \geq 3$ the title equation has no solutions.

math.NT↗

arXiv2017

On a variant of Pillai's problem II

In this paper, we show that there are only finitely many $c$ such that the equation $U_n - V_m = c$ has at least two distinct solutions $(n,m)$, where $\{U_n\}_{n\geq 0}$ and $\{V_m\}_{m\geq 0}$ are given linear recurrence sequences.

math.NT↗

arXiv2016

Effective Resolution of Diophantine equations of the form $u_n+u_m=w p_1^{z_1} \cdots p_s^{z_s}$

Let $u_n$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, $w$ a fixed non-zero integer and $p_1,p_2,\dots,p_s$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $u_n+u_m=w p_1^{z_1} \cdots p_s^{z_s}$ and prove under mild technical restrictions effective finiteness results. In particular we give explicit upper bounds for $n,m$ and $z_1, \dots, z_s$. Furthermore, we provide a rather efficient algorithm to solve Diophantine equations of the described type and we demonstrate our method by an example.

math.NT↗

arXiv2016

On a variant of Pillai's problem

In this paper, we find all integers $c$ having at least two representations as a difference between a Fibonacci number and a Tribonacci number.

math.NT↗

arXiv2015

Finiteness results for Diophantine triples with repdigit values

Let $g\ge 2$ be an integer and $\mathcal R_g\subset \mathbb N$ be the set of repdigits in base $g$. Let $\mathcal D_g$ be the set of Diophantine triples with values in $\mathcal R_g$; that is, $\mathcal D_g$ is the set of all triples $(a,b,c)\in \mathbb N^3$ with $c<b<a$ such that $ab+1,ac+1$ and $ab+1$ lie in the set $\mathcal R_g$. In this paper, we prove effective finitness results for the set $\mathcal D_g$.

math.NT↗