Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Márton Szikszai"'
Autor:
Márton Szikszai, Volker Ziegler
Publikováno v:
Journal of Number Theory. 201:354-376
In this paper, we provide an effective and practical method to find all three term arithmetic progressions in a given Lucas sequence of the first or second kind. Our interest is the case when the sequence has a negative discriminant, since the case o
Autor:
Márton Szikszai, Carlo Sanna
Publikováno v:
Bulletin of the London Mathematical Society. 49:908-915
Let $f\in\mathbb{Z}[X]$ be quadratic or cubic polynomial. We prove that there exists an integer $G_f\geq 2$ such that for every integer $k\geq G_f$ one can find infinitely many integers $n\geq 0$ with the property that none of $f(n+1),f(n+2),\dots,f(
Publikováno v:
Bulletin of the Australian Mathematical Society. 94:395-404
Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots B_{m+(k-1)d}=y^\ell \end{
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are infinitely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a561163dfb3e83f434ab5347b53bc0d
Autor:
Márton Szikszai, István Pink
Publikováno v:
Glasnik matematički
Volume 52
Issue 1
Volume 52
Issue 1
This paper deals with a Brocard-Ramanujan-type equation of the form un1un2 ⋯ unk+1=um2 in unknown nonnegative integers k,n1,n2, …,nk and m with k≥ 1, where u=(un)n=0∞ is either a Lucas sequence or its associated sequence. For certain infinite
Publikováno v:
Proceedings of the 9th International Conference on Applied Informatics, Volume 2.
In wireless communication networks, interference produced by simultaneous transmission of the undesired transmitters and useful signal sources is one of the central aspects in system designs, since it dominantly limits network performance. We sampled
Autor:
Márton Szikszai, Lajos Hajdu
We prove that for any elliptic divisibility sequence and any sufficiently large integer k, one can find k consecutive terms of the sequence such that none of these terms is coprime to all the others. In other words, elliptic divisibility sequences ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc9bbac99438ad1098f60c4018d68925