Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Salim Badidja"'
Autor:
Abdeldjabar Hamdi, Salim Badidja
Publikováno v:
Notes on Number Theory and Discrete Mathematics. 27:137-147
In this study, we denote $(t'_{n}(x))_{n\in \mathbb{N}}$ the generalized Tribonacci polynomials, which are defined by $t'_{n}(x)=x^{2}t'_{n-1}(x)+xt'_{n-2}(x)+t'_{n-3}(x), n \geqslant 4,$ with $t_{1}(x)=a, t_{2}(x)=b, t_{3}(x)=cx^{2}$ and we drive an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ed0d301caa4c6dc8665d5f064528803
https://doi.org/10.7546/nntdm.2021.27.2.137-147
https://doi.org/10.7546/nntdm.2021.27.2.137-147
Autor:
Salim Badidja, Ibtissam Talha
Publikováno v:
Asian-European Journal of Mathematics. 15
In this paper, we deal with the periodicity of solutions of the following general system rational of difference equations: [Formula: see text] where [Formula: see text] [Formula: see text] and the initial conditions are arbitrary nonzero real numbers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8fb29ced604b22b7af961680eff5080
https://doi.org/10.1142/s1793557122500875
https://doi.org/10.1142/s1793557122500875
Autor:
Abdeldjabar Hamdi, Salim Badidja
Publikováno v:
Asian-European Journal of Mathematics. 15
In this study, we give another formula to all the generalized tribonacci [Formula: see text] and generalized tribonacci-Lucas [Formula: see text] polynomials by using the combinatorial calculus and their sum. Then, we give the explicit formula of par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f767c9cd92a958a4a6398378046f4458
https://doi.org/10.1142/s1793557122500280
https://doi.org/10.1142/s1793557122500280
The aim of this paper is to construct a relation between tribonacci numbers and generalized tribonacci numbers. Besides, certain conditions are obtained to generalize the representation of a positive integer [Formula: see text] which is determined in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da5bd54da4971595dcad6a2be752d864
https://hdl.handle.net/20.500.11857/3204
https://hdl.handle.net/20.500.11857/3204
Autor:
Salim Badidja, Abdelmadjid Boudaoud
Publikováno v:
Journal of Mathematics and Statistics. 13:57-61
Let (Tm)m≥1 be the tribonacci sequence. We show that every integer N ≥ 1 can be written as a sum of the terms αm Tm, where m runs over the set of strictly positive integers and αm (m ≥ 1) are either 1 or 0. The previous representation of N is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55462bc05ed63daef3a037e87cd46091
https://doi.org/10.3844/jmssp.2017.57.61
https://doi.org/10.3844/jmssp.2017.57.61