Academic literature on the topic 'Tribonacci numbers'

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

Yüksel, Soykan, Taşdemir Erkan, Okumuş İnci, and Göcen Melih. "Gaussian Generalized Tribonacci Numbers." Journal of Progressive Research in Mathematics 14, no. 2 (2018): 2373–87. https://doi.org/10.5281/zenodo.3974192.

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

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
3

Kızılaslan, Gonca, and Leyla Karabulut. "Unrestricted Tribonacci and Tribonacci–Lucas quaternions." Notes on Number Theory and Discrete Mathematics 29, no. 2 (2023): 310–21. http://dx.doi.org/10.7546/nntdm.2023.29.2.310-321.

Full text
Abstract:
We define a generalization of Tribonacci and Tribonacci–Lucas quaternions with arbitrary Tribonacci numbers and Tribonacci–Lucas numbers coefficients, respectively. We get generating functions and Binet’s formulas for these quaternions. Furthermore, several sum formulas and a matrix representation are obtained.
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 (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 th
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Erduvan, Fatih. "Tribonacci numbers as sum or difference of powers of 2." Celal Bayar Üniversitesi Fen Bilimleri Dergisi 21, no. 2 (2025): 147–51. https://doi.org/10.18466/cbayarfbe.1528991.

Full text
Abstract:
This paper investigates Tribonacci numbers can be expressed as either the sum or difference of two distinct powers of 2. Namely, we address the problem of expressing Tribonacci numbers in the form T_n=2^x±2^y in positive integers with 1≤y≤x. Our findings reveal specific instances where such representations are possible, including examples like the seventh Tribonacci number expressed both as the sum and the difference of powers of 2. Additionally, we identify Tribonacci numbers that can be represented as the differences of Mersenne numbers, specifically, the numbers 2, 4, 24, and 504. These res
APA, Harvard, Vancouver, ISO, and other styles
7

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 invar
APA, Harvard, Vancouver, ISO, and other styles
8

Yüksel, Soykan. "On Four Special Cases of Generalized Tribonacci Sequence: Tribonacci-Perrin, modified Tribonacci, modified TribonacciLucas and adjusted Tribonacci-Lucas Sequences." Journal of Progressive Research in Mathematics 16, no. 3 (2020): 3056–84. https://doi.org/10.5281/zenodo.3973345.

Full text
Abstract:
In this paper, we investigate four new special cases, namely, Tribonacci-Perrin, modified Tribonacci, modified Tribonacci-Lucas, adjusted Tribonacci-Lucas sequences, of the generalized Tribonacci sequences. We present Binet’s formulas, generating functions, Simson formulas, and the summation formulas for these sequences. Moreover, we give some identities and matrices related with these sequences.
APA, Harvard, Vancouver, ISO, and other styles
9

Hulku, Sakıne, and Ömür Devec. "The Tribonacci-type balancing numbers and their applications." Mathematica Moravica 27, no. 1 (2023): 23–36. http://dx.doi.org/10.5937/matmor2301023h.

Full text
Abstract:
N this paper, we define the Tribonacci-type balancing numbers via a Diophantine equation with a complex variable and then give their miscellaneous properties. Also, we study the Tribonacci-type balancing sequence modulo m and then obtain some interesting results concerning the periods of the Tribonacci-type balancing sequences for any m. Furthermore, we produce the cyclic groups using the multiplicative orders of the generating matrices of the Tribonacci-type balancing numbers when read modulo m. Then give the connections between the periods of the Tribonacci-type balancing sequences modulo m
APA, Harvard, Vancouver, ISO, and other styles
10

BASU, MANJUSRI, and MONOJIT DAS. "TRIBONACCI MATRICES AND A NEW CODING THEORY." Discrete Mathematics, Algorithms and Applications 06, no. 01 (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
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)<br>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)<br>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<br>Coor
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. 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. 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. 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. John Wiley & Sons, Inc., 2019. http://dx.doi.org/10.1002/9781118742297.ch49.

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

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

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, Tri
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
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!