Relevant bibliographies by topics / Tribonacci numbers

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Tribonacci numbers'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Tribonacci numbers.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Tribonacci numbers"

1

Tasyurdu, Yasemin. "Tribonacci and Tribonacci-Lucas hybrid numbers." International Journal of Contemporary Mathematical Sciences 14, no. 4 (2019): 245–54. http://dx.doi.org/10.12988/ijcms.2019.91124.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Frontczak, Robert. "Sums of Tribonacci and Tribonacci-Lucas numbers." International Journal of Mathematical Analysis 12, no. 1 (2018): 19–24. http://dx.doi.org/10.12988/ijma.2018.712153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Demirci, Musa, and Ismail Naci Cangul. "Tribonacci graphs." ITM Web of Conferences 34 (2020): 01002. http://dx.doi.org/10.1051/itmconf/20203401002.

Full text
Abstract:
Special numbers have very important mathematical properties alongside their numerous applications in many fields of science. Probably the most important of those is the Fibonacci numbers. In this paper, we use a generalization of Fibonacci numbers called tribonacci numbers having very limited properties and relations compared to Fibonacci numbers. There is almost no result on the connections between these numbers and graphs. A graph having a degree sequence consisting of t successive tribonacci numbers is called a tribonacci graph of order t. Recently, a new graph parameter named as omega invariant has been introduced and shown to be very informative in obtaining combinatorial and topological properties of graphs. It is useful for graphs having the same degree sequence and gives some common properties of the realizations of this degree sequence together with some properties especially connectedness and cyclicness of all realizations. In this work, we determined all the tribonacci graphs of any order by means of some combinatorial results. Those results should be useful in networks with large degree sequences and cryptographic applications with special numbers.
APA, Harvard, Vancouver, ISO, and other styles
4

Adegoke, Kunle, Adenike Olatinwo, and Winning Oyekanmi. "New Tribonacci recurrence relations and addition formulas." Notes on Number Theory and Discrete Mathematics 26, no. 4 (November 2020): 164–72. http://dx.doi.org/10.7546/nntdm.2020.26.4.164-172.

Full text
Abstract:
Only one three-term recurrence relation, namely, W_{r}=2W_{r-1}-W_{r-4}, is known for the generalized Tribonacci numbers, W_r, r\in Z, defined by W_{r}=W_{r-1}+W_{r-2}+W_{r-3} and W_{-r}=W_{-r+3}-W_{-r+2}-W_{-r+1}, where W_0, W_1 and W_2 are given, arbitrary integers, not all zero. Also, only one four-term addition formula is known for these numbers, which is W_{r + s} = T_{s - 1} W_{r - 1} + (T_{s - 1} + T_{s-2} )W_r + T_s W_{r + 1}, where ({T_r})_{r\in Z} is the Tribonacci sequence, a special case of the generalized Tribonacci sequence, with W_0 = T_0 = 0 and W_1 = W_2 = T_1 = T_2 = 1. In this paper we discover three new three-term recurrence relations and two identities from which a plethora of new addition formulas for the generalized Tribonacci numbers may be discovered. We obtain a simple relation connecting the Tribonacci numbers and the Tribonacci–Lucas numbers. Finally, we derive quadratic and cubic recurrence relations for the generalized Tribonacci numbers.
APA, Harvard, Vancouver, ISO, and other styles
5

Choi, Eunmi, and Jiin Jo. "IDENTITIES INVOLVING TRIBONACCI NUMBERS." Journal of the Chungcheong Mathematical Society 28, no. 1 (February 15, 2015): 39–51. http://dx.doi.org/10.14403/jcms.2015.28.1.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tasyurdu, Yasemin. "On the sums of Tribonacci and Tribonacci-Lucas numbers." Applied Mathematical Sciences 13, no. 24 (2019): 1201–8. http://dx.doi.org/10.12988/ams.2019.910144.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Choi, Eunmi, and Jiin Jo. "On Partial Sum of Tribonacci Numbers." International Journal of Mathematics and Mathematical Sciences 2015 (2015): 1–8. http://dx.doi.org/10.1155/2015/301814.

Full text
Abstract:
We study the sumst(k,r)=∑i=0tTki+rofkstep apart Tribonacci numbers for any1≤r≤k. We prove thatst(k,r)satisfies certain Tribonacci rulest(k,r)=akst-1(k,r)+bkst-2(k,r)+st-3(k,r)+λwith integersak,bk,ck, andλ.
APA, Harvard, Vancouver, ISO, and other styles
8

BASU, MANJUSRI, and MONOJIT DAS. "TRIBONACCI MATRICES AND A NEW CODING THEORY." Discrete Mathematics, Algorithms and Applications 06, no. 01 (February 18, 2014): 1450008. http://dx.doi.org/10.1142/s1793830914500086.

Full text
Abstract:
In this paper, we consider the series of Tribonacci numbers. Thereby, we introduce a new coding theory called Tribonacci coding theory based on Tribonacci numbers and show that in the simplest case, the correct ability of this method is 99.80% whereas the correct ability of the Fibonacci coding/decoding method is 93.33%.
APA, Harvard, Vancouver, ISO, and other styles
9

Badidja, Salim, Ahmed Ait Mokhtar, and Özen Özer. "Representation of integers by k-generalized Fibonacci sequences and applications in cryptography." Asian-European Journal of Mathematics 14, no. 09 (February 8, 2021): 2150157. http://dx.doi.org/10.1142/s1793557121501576.

Full text
Abstract:
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 [S. Badidja and A. Boudaoud, Representation of positive integers as a sum of distinct tribonacci numbers, J. Math. Statistic. 13 (2017) 57–61] for a [Formula: see text]-generalized Fibonacci numbers [Formula: see text]. Lastly, some applications to cryptography are given by using [Formula: see text].
APA, Harvard, Vancouver, ISO, and other styles
10

Bravo, Eric F., and Jhon J. Bravo. "Tribonacci numbers with two blocks of repdigits." Mathematica Slovaca 71, no. 2 (April 1, 2021): 267–74. http://dx.doi.org/10.1515/ms-2017-0466.

Full text
Abstract:
Abstract The Tribonacci sequence is a generalization of the Fibonacci sequence which starts with 0,0,1 and each term afterwards is the sum of the three preceding terms. Here, we show that the only Tribonacci numbers that are concatenations of two repdigits are 13,24,44,81. This paper continues a previous work that searched for Fibonacci numbers which are concatenations of two repdigits.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Tribonacci numbers"

1

Fransson, Jonas. "Generalized Fibonacci Series Considered modulo n." Thesis, Linnéuniversitetet, Institutionen för matematik (MA), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-26844.

Full text
Abstract:
In this thesis we are investigating identities regarding Fibonacci sequences. In particular we are examiningthe so called Pisano period, which is the period for the Fibonacci sequence considered modulo n to repeatitself. The theory shows that it suces to compute Pisano periods for primes. We are also looking atthe same problems for the generalized Pisano period, which can be described as the Pisano period forthe generalized Fibonacci sequence.
APA, Harvard, Vancouver, ISO, and other styles
2

Meinke, Ashley Marie. "Fibonacci Numbers and Associated Matrices." Kent State University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=kent1310588704.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Almeida, Edjane Gomes dos Santos. "Propriedades e generalizações dos números de Fibonacci." Universidade Federal da Paraíba, 2014. http://tede.biblioteca.ufpb.br:8080/handle/tede/7658.

Full text
Abstract:
Submitted by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:34:27Z No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5)
Approved for entry into archive by Maria Suzana Diniz (msuzanad@hotmail.com) on 2015-11-30T12:38:24Z (GMT) No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5)
Made available in DSpace on 2015-11-30T12:38:24Z (GMT). No. of bitstreams: 1 arquivototal.pdf: 766531 bytes, checksum: ad20186d0268a15265279ab809f9fd2f (MD5) Previous issue date: 2014-08-29
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES
This work is about research done Fibonacci's Numbers. Initially it presents a brief account of the history of Leonardo Fibonacci, from his most famous work,The Liber Abaci, to the relationship with other elds of Mathematics. Then we will introduce some properties of Fibonacci's Numbers, Binet's Form, Lucas' Numbers and the relationship with Fibonacci's Sequence and an important property observed by Fermat. Within relationships with other areas of Mathematics, we show the relationship Matrices, Trigonometry and Geometry. Also presents the Golden Ellipse and the Golden Hyperbola. We conclude with Tribonacci's Numbers and some properties that govern these numbers. Made some generalizations about Matrices and Polynomials Tribonacci.
Este trabalho tem como objetivo o estudo dos Números de Fibonacci. Apresenta-se inicialmente um breve relato sobre a história de Leonardo Fibonacci, desde sua obra mais famosa, O Liber Abaci, até a relação com outros campos da Matemática. Em seguida, apresenta-se algumas propriedades dos Números de Fibonacci, a Fórmula de Binet, os Números de Lucas e a relação com a Sequência de Fibonacci e uma importante propriedade observada por Fermat. Dentro das relações com outras áreas da Matemática, destacamos a relação com as Matrizes, com a Trigonometria, com a Geometria. Apresenta-se também a Elipse e a Hipérbole de Ouro. Concluímos com os Números Tribonacci e algumas propriedades que regem esses números. Realizamos algumas generalizações sobre Matrizes e Polinômios Tribonacci.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Tribonacci numbers"

1

Lee, Jack Y. "Some Basic Properties of a Tribonacci Line-Sequence." In Applications of Fibonacci Numbers, 145–57. Dordrecht: Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-0-306-48517-6_15.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Waddill, Marcellus E. "Using Matrix Techniques to Establish Properties of a Generalized Tribonacci Sequence." In Applications of Fibonacci Numbers, 299–308. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3586-3_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

"Tribonacci Numbers." In Fibonacci and Lucas Numbers with Applications, 527–32. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118033067.ch46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

"Tribonacci Polynomials." In Fibonacci and Lucas Numbers with Applications, 533–36. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118033067.ch47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

"Tribonacci Polynomials." In Fibonacci and Lucas Numbers With Applications, 611–29. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2019. http://dx.doi.org/10.1002/9781118742297.ch49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Braswell, Leigh Marie, and Tanya Khovanova. "The Cookie Monster Problem." In The Mathematics of Various Entertaining Subjects. Princeton University Press, 2015. http://dx.doi.org/10.23943/princeton/9780691164038.003.0016.

Full text
Abstract:
This chapter examines the problem of the “Cookie Monster number.” In 2002, Cookie Monster® appeared in the book The Inquisitive Problem Solver by Vaderlind, Guy, and Larson, where the hungry monster wants to empty a set of jars filled with various numbers of cookies. The Cookie Monster number is the minimum number of moves Cookie Monster must use to empty all the jars. The chapter analyzes this problem by first introducing known general algorithms and known bounds for the Cookie Monster number. It then explicitly finds the Cookie Monster number for jars containing cookies in the Fibonacci, Tribonacci, n-nacci, and Super-n-nacci sequences. The chapter also constructs sequences of k jars such that their Cookie Monster numbers are asymptotically rk, where r is any real number, 0 ≤ r ≤ 1.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Tribonacci numbers"

1

Irmak, Nurettin, and Abdullah Açikel. "On perfect numbers close to Tribonacci numbers." In 1ST INTERNATIONAL CONFERENCE ON MATHEMATICAL AND RELATED SCIENCES (ICMRS 2018). Author(s), 2018. http://dx.doi.org/10.1063/1.5047878.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Tribonacci numbers' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography