English
Related papers

Related papers: A consideration of the Fibonacci sequence modulo m

200 papers

For any positive integer $r$, the $r$-Fubini number with parameter $n$, denoted by $F_{n,r}$, is equal to the number of ways that the elements of a set with $n+r$ elements can be weak ordered such that the $r$ least elements are in distinct…

Number Theory · Mathematics 2017-01-26 Amir Abbas Asgari , Majid Jahangiri

We classify all solution triples with $k$-Fibonacci components to the equation $x^2+y^2+z^2=3xyz+m,$ where $m$ is a positive integer and $k\geq 2$. As a result, for $m=8$, we have the Markoff triples with Pell components $(F_2(2), F_2(2n),…

General Mathematics · Mathematics 2024-09-24 D. Alfaya , L. A. Calvo , A. Martínez de Guinea , J. Rodrigo , A. Srinivasan

Let $a$ and $m>0$ be integers. We show that for any integer $b$ relatively prime to $m$, the set $\{a^n+bn:\ n=1,\ldots,m^2\}$ contains a complete system of residues modulo $m$. We also pose several conjectures for further research; for…

Number Theory · Mathematics 2014-02-28 Zhi-Wei Sun

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

Number Theory · Mathematics 2024-03-22 Florian Luca , Tom Ward

We give a few remarks on the periodic sequence $a_n=\binom{n}{x}~(mod~m)$ where $x,m,n\in \mathbb{N}$, which is periodic with minimal length of the period being…

Number Theory · Mathematics 2015-09-29 Alexandre Laugier , Manjil Saikia

Let $\epsilon$ be a fixed positive quantity, $m$ be a large integer, $x_j$ denote integer variables. We prove that for any positive integers $N_1,N_2,N_3$ with $N_1N_2N_3>m^{1+\epsilon},$ the set $$ \{x_1x_2x_3 \pmod m: \quad x_j\in [1,N_j]…

Number Theory · Mathematics 2008-08-11 M. Z. Garaev

In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…

Number Theory · Mathematics 2021-08-03 A. P. Akande , Robert Schneider

We study integral almost square-free modular categories; i.e., integral modular categories of Frobenius-Perron dimension $p^nm$, where $p$ is a prime number, $m$ is a square-free natural number and ${\rm gcd}(p,m)=1$. We prove that if…

Category Theory · Mathematics 2016-05-24 Jingcheng Dong , Libin Li , Li Dai

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

Combinatorics · Mathematics 2019-01-03 James Mc Laughlin , Nancy J. Wyshinski

We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…

Combinatorics · Mathematics 2018-06-26 Christian Krattenthaler , Thomas W. Müller

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

Combinatorics · Mathematics 2024-09-04 Michael A. Allen , Kenneth Edwards

The Fibonacci sequence $\mathbb{F}$ is the fixed point beginning with $a$ of morphism $\sigma(a,b)=(ab,a)$. Since $\mathbb{F}$ is uniformly recurrent, each factor $\omega$ appears infinite many times in the sequence which is arranged as…

Dynamical Systems · Mathematics 2016-04-19 Huang Yuke , Wen Zhiying

The Fishburn numbers $\xi (n)$ are defined by the formal power series \[ \sum_{n \geq 0} \xi (n) q^n = \sum_{n \geq 0} \prod_{j = 1}^n (1 - (1 - q)^j). \] Recently, G. Andrews and J. Sellers discovered congruences of the form $\xi (p m + j)…

Number Theory · Mathematics 2015-05-19 Armin Straub

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…

Number Theory · Mathematics 2015-07-20 Jeremy Alm , Taylor Herald

In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…

Number Theory · Mathematics 2022-04-11 Bartosz Sobolewski , Maciej Ulas

Fixed two positive integers m and e, some algorithms for computing the minimal Frobenius number and minimal genus of the set of numerical semigroups with multiplicity m and embedding dimension e are provided. Besides, the semigroups where…

Commutative Algebra · Mathematics 2017-12-15 J. I. García-García , D. Marín-Aragón , M. A. Moreno-Frías , J. C. Rosales , A. Vigneron-Tenorio

We study the combinatorial properties of final types, which are certain non-decreasing sequences of integers, together with the partitions naturally associated with them. As a consequence, we obtain an identity expressing the $n$-nacci…

Combinatorics · Mathematics 2026-01-27 Dušan Dragutinović

Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when…

Number Theory · Mathematics 2019-01-01 Neranga Fernando , Mohammad Rashid

We study the period of the linear map $T:\mathbb{Z}_m^n\rightarrow \mathbb{Z}_m^n:(a_0,\dots,a_{n-1})\mapsto(a_0+a_1,\dots,a_{n-1}+a_0)$ as a function of $m$ and $n$, where $\mathbb{Z}_m$ stands for the ring of integers modulo $m$. Since…

Number Theory · Mathematics 2023-04-18 Bruno Dular

This paper investigates the natural density and structural relationships within Fibonacci words, the density of a Fibonacci word is $\operatorname{DF}(F_k)=n/(n+m),$ where $m$ denote the number of zeros in a Fibonacci word and $n$ denote…

Combinatorics · Mathematics 2025-10-29 Duaa Abdullah , Jasem Hamoud