English
Related papers

Related papers: A consideration of the Fibonacci sequence modulo m

200 papers

Let q be a prime power and N_n count degree-n monic irreducible polynomials in F_q[x]. We show that prod_{n=1}^{\infty} (1 -z^n)^N_n = 1 - qz for small |z|.

Number Theory · Mathematics 2007-05-23 Barry Brent

We investigate the number of parts modulo $m$ of $m$-ary partitions of a positive integer $n$. We prove that the number of parts is equidistributed modulo $m$ on a special subset of $m$-ary partitions. As consequences, we explain when the…

Combinatorics · Mathematics 2016-03-02 Tom Edgar

In this paper, using a generating function approach, we derive several new convolution sum identities involving Fibonacci m-step numbers. As special instances of the results derived herein, we will get many new and known results involving…

General Mathematics · Mathematics 2024-04-01 Robert Frontczak , Karol Gryszka

Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…

Number Theory · Mathematics 2017-08-24 Bernd C. Kellner

Mizuno provided 19 examples of generalized rank three Nahm sums with symmetrizer $\mathrm{diag}(1,1,2)$ which are conjecturally modular. We confirm their modularity by establishing Rogers--Ramanujan type identities of index $(1,1,2)$ for…

Number Theory · Mathematics 2024-02-12 Boxue Wang , Liuquan Wang

Let $a, b\in \mathbb{N}$ be relatively prime. Previous work showed that exactly one of the two equations $ax + by = (a-1)(b-1)/2$ and $ax + by + 1 = (a-1)(b-1)/2$ has a nonnegative, integral solution; furthermore, the solution is unique.…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Combinatorics · Mathematics 2023-09-18 Sejin Park , Etienne Phillips , Peikai Qi , Ilir Ziba , Zhan Zhan

Let $(U_n)_{n\in \mathbb{N}}$ be a fixed linear recurrence sequence defined over the integers (with some technical restrictions). We prove that there exist effectively computable constants $B$ and $N_0$ such that for any $b,c\in \mathbb{Z}$…

Number Theory · Mathematics 2023-12-05 Sebastian Heintze , Robert F. Tichy , Ingrid Vukusic , Volker Ziegler

Suppose that $p$ is an odd prime and $m$ is an integer not divisible by $p$. Sun and Tauraso [Adv. in Appl. Math., 45(2010), 125--148] gave $\sum_{k=0}^{n-1}\binom{2k}{k+d}/m^k$ and $\sum_{k=0}^{n-1}\binom{2k}{k+d}/(km^k)$ modulo $p$ for…

Number Theory · Mathematics 2021-10-22 He-Xia Ni

We introduce the $2$-regular integer sequence A383066 $= (s(n))_{n \geq 1}$, which begins $0, 1, 1, 2, 3, 3, 2, \ldots$. We prove that the number of occurrences of an integer $m \geq 0$ in this sequence is equal to $\tau(m^2+1)$, the number…

Number Theory · Mathematics 2025-10-28 Anton Shakov

For a given prime $p$, we determine the limit, as $\lambda \to \infty$, of the density of residues modulo $p^\lambda$ attained by the Fibonacci sequence. In particular, we show that this limiting density is related to zeros in the sequence…

Number Theory · Mathematics 2025-08-26 Nicholas Bragman , Eric Rowland

This paper investigates randomness properties of sequences derived from Fibonacci and Gopala-Hemachandra sequences modulo m for use in key distribution applications. We show that for sequences modulo a prime a binary random sequence B(n) is…

Cryptography and Security · Computer Science 2015-03-13 Krishnamurthy Kirthi , Subhash Kak

In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \geq 1$ and $k \geq 3$. Here, $\{ F_t \}_{t=0}^{\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation…

Number Theory · Mathematics 2024-12-18 Seyran S. Ibrahimov , Nazim I. Mahmudov

We confirm Sun's conjecture that $(\root{n+1}\of{F_{n+1}}/\root{n}\of{F_n})_{n\ge 4}$ is strictly decreasing to the limit 1, where $(F_n)_{n\ge0}$ is the Fibonacci sequence. We also prove that the sequence…

Combinatorics · Mathematics 2014-12-24 Qing-Hu Hou , Zhi-Wei Sun , Haomin Wen

Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…

Number Theory · Mathematics 2014-09-30 Jakub Byszewski , Maciej Ulas

In this thesis we examined mathematical properties of Fibonacci numbers and applications of this numbers in the nature,geometry and economy.We obtained Golden section and proved some mathematical identities using Golden section. Infinity of…

History and Overview · Mathematics 2013-01-29 Erdoğan Şen

In this article we finish the study of solutions of the equation $x^2-2^m=y^n$ for $m\in\mathbb{Z}$ and $n\geq3$. This is achieved using the modularity method in unsolved cases, namely, we prove that the only integer solutions of…

Number Theory · Mathematics 2021-11-16 Lucas Villagra Torcomian

Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…

Number Theory · Mathematics 2016-02-02 Ying-jun Guo , Zhi-xiong Wen , Jie-meng Zhang

In these notes we study the $k$-generalized Fibonacci sequences - $(F_n^{(k)})_{n\in \Z}$ - with positive and negative indices. Denote $T_k(x)$ its characteristic polynomial. Our most interesting finding is that if $k$ is even then the…

Number Theory · Mathematics 2020-08-26 Attila Pethő

The problem of invariance and self-similarity in Z-modules is investigated. For a selection of examples relevant to quasicrystals, especially Fibonacci modules, we determine the semigroup of self-similarities and encapsulate the number of…

Mathematical Physics · Physics 2007-05-23 Michael Baake , Robert V. Moody