Pillai's problem with the Padovan and tribonacci sequences

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F19%3AA20023PE" target="_blank" >RIV/61988987:17310/19:A20023PE - isvavai.cz</a>

Result on the web

<a href="http://www.amsallahabad.org/ijm.html" target="_blank" >http://www.amsallahabad.org/ijm.html</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Pillai's problem with the Padovan and tribonacci sequences

Original language description

Let (Tn)n>0 and (Pn)n>0 be the Tribonacci and the Padovan sequences given by T0 = 0, T1 = T2 = 1, P0 = 0, P1 = P2 = 1 and the recurrence formulas Tn+3 = Tn+2 + Tn+1 + Tn, Pn+3 = Pn+1 + Pn for all n > 0, respectively. In this note we study and completely solve the Diophantine equation Pn − Tm = Pn1 − Tm1 in nonnegative integers (n, m, n1, m1) with (n, m) 6= (n1, m1).

Czech name

—

Czech description

—

Type

J_ost - Miscellaneous article in a specialist periodical

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2019

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Indian Journal of Mathematics

ISSN

0019-5324

e-ISSN

—

Volume of the periodical

61

Issue of the periodical within the volume

1

Country of publishing house

IN - INDIA

Number of pages

15

Pages from-to

61-75

UT code for WoS article

—

EID of the result in the Scopus database

—