Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Pagdame Tiebekabe"'
Autor:
Pagdame Tiebekabe, Ismaïla Diouf
Publikováno v:
Journal of Mathematical Chemistry. 59:2009-2020
In this paper, we established the bound of n in term of p of the following equation $${\mathcal {F}}_n=2^p\quad {\text {with}}\quad n,p\ge 0 $$ where $$\{{\mathcal {F}}_n\}_{n\ge 0}$$ represent Fibonacci sequence defined by the following relation : $
Autor:
Pagdame Tiebekabe, Serge Adonsou
In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses lower bounds
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e02cae25e7b2edfa25bd6cf027db5533
Autor:
Pagdame Tiebekabe, Ismaïla Diouf
Publikováno v:
Far East Journal of Mathematical Education
Far East Journal of Mathematical Education, Pushpa Publishing House, 2021, 21 (1), pp.31-41. ⟨10.17654/ME021010031⟩
Far East Journal of Mathematical Education, Pushpa Publishing House, 2021, 21 (1), pp.31-41. ⟨10.17654/ME021010031⟩
International audience; In this article, we first made the inventory of some various divisibility tests of 7 known, studied the effectiveness of these tests, demonstrate the new divisibility test of 7 proposed by the young Nigerian Chika Ofili and an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fc1e49759ec2051af06cd4fff22be53
https://hal.archives-ouvertes.fr/hal-03204944
https://hal.archives-ouvertes.fr/hal-03204944
Autor:
Pagdame Tiebekabe, Ismaïla Diouf
Publikováno v:
JP Journal of Algebra, Number Theory and Applications
JP Journal of Algebra, Number Theory and Applications, Pushpa Publishing House, 2021, 49 (2), pp.185-196. ⟨10.17654/NT049020185⟩
JP Journal of Algebra, Number Theory and Applications, Pushpa Publishing House, 2021, 49 (2), pp.185-196. ⟨10.17654/NT049020185⟩
International audience; The goal of this paper is to find, in a simple and rigorous way, all powers of three as the difference of two Fibonacci numbers, that is, we study a Diophantine equation p Fn − Fm = 3 in nonnegative integers n, m and p, wher
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b45372cfa27ff36b53140a49ae87424
https://hal.archives-ouvertes.fr/hal-03204945
https://hal.archives-ouvertes.fr/hal-03204945
Autor:
Pagdame Tiebekabe, Ismaïla Diouf
Publikováno v:
HAL
Let (Ln) n≥0 be the Lucas sequence given by L0 = 2, L1 = 1 and Ln+2 = Ln+1 + Ln for n ≥ 0. In this paper, we are interested in finding all powers of three which are sums of two Lucas numbers, i.e., we study the exponential Diophantine equation Ln
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a1d8c1dfd616f8249b1ae7b2d8b5c0c4
https://hal.archives-ouvertes.fr/hal-03243010
https://hal.archives-ouvertes.fr/hal-03243010