English
Related papers

Related papers: Fibonacci system and residue completeness

200 papers

Let P and Q be non-zero relatively prime integers. The Lucas sequence {U_n(P,Q) is defined by U_0=0, U_1=1, U_n = P U_{n-1}-Q U_{n-2} for n>1. The sequence {U_n(1,-1)} is the familiar Fibonacci sequence, and it was proved by Cohn that the…

Number Theory · Mathematics 2007-05-23 Andrew Bremner , Nikos Tzanakis

Let $E_C$ be the hypergeometric system of differential equations satisfied by Lauricella's hypergeometric series $F_C$ of $m$ variables. We show that the monodromy representation of $E_C$ is irreducible under our assumption consisting of…

Algebraic Geometry · Mathematics 2018-04-17 Yoshiaki Goto , Keiji Matsumoto

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

Combinatorics · Mathematics 2015-06-15 Daniel Horsley , Rosalind A. Hoyte

Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad…

Number Theory · Mathematics 2021-04-07 Shanta Laishram

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Combinatorics · Mathematics 2023-07-04 Yuval Filmus , Eldar Fischer , Johann A. Makowsky , Vsevolod Rakita

The Lucas sequences are integers defined by a homogeneous recurrence relation. They include the well-known Fibonacci numbers, which appear abundantly in nature. The complementary Lucas numbers, defined by the same recurrence relation, are…

Quantum Physics · Physics 2026-04-13 Li Ge

In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

Let $F_n$ be the $n$th Fibonacci number. Let $m, n$ be positive integers. Define a sequence $(G(k,n,m))_{k\geq 1}$ by $G(1,n,m) = F^m_n$, and $G(k+1,n,m) = F_{nG(k,n,m)}$ for all $k\geq 1$. We show that $F_n^{k+m-1}\mid G(k,n,m)$ for all…

Number Theory · Mathematics 2014-05-29 Kritkajohn Onphaeng , Prapanpong Pongsriiam

We classify all solution triples with Fibonacci components to the equation $a^2+b^2+c^2=3abc+m,$ for positive $m$. We show that for $m=2$ they are precisely $(1,F(b),F(b+2))$, with even $b$; for $m=21$, there exist exactly two Fibonacci…

Number Theory · Mathematics 2025-01-30 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

We develop a general framework for finding all perfect powers in sequences derived by shifting non-degenerate quadratic Lucas-Lehmer binary recurrence sequences by a fixed integer. By combining this setup with bounds for linear forms in…

Number Theory · Mathematics 2018-11-28 Michael Bennett , Vandita Patel , Samir Siksek

In this article, we consider the Diophantine equation $\sigma_{2}(n)-n^2=An+B$ with $A=P^2\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\leq(|A|+|B|)^{3}$, all the solutions are expressible…

Number Theory · Mathematics 2017-09-20 Hao Zhong , Tianxin Cai

We say that an arithmetical function $S:\mathbb{N}\rightarrow\mathbb{Z}$ has Lucas property if for any prime $p$, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where $n=\sum_{i=0}^{r}n_{i}p^{i}$, with…

Number Theory · Mathematics 2016-12-22 Hao Zhong , Tianxin Cai

It is conjectured that for a perfect number $m,$ $\rm{rad}(m)\ll m^{\frac{1}{2}}.$ We prove bounds on the radical of multiperfect number $m$ depending on its abundancy index. Assuming the ABC conjecture, we apply this result to study gaps…

Number Theory · Mathematics 2019-01-01 Nithin Kavi , Xinyi Zhang , Viraj Jayam , Ajit Kadaveru

We try to find all quadruples of positive integers $(m,a,b,c)$ with $a \geq b \geq c$ such that there exists a distinct covering system with minimum modulus $m$ and least common multiple of the moduli $2^a 3^b 5^c$. We obtain complete…

Number Theory · Mathematics 2026-05-19 Joshua Harrington , Jonah Klein , Joshua Lowrance , Ognian Trifonov

We give a criterion for rings with $\m^3=0$ which are obtained as connected sums of two other rings to have non-trivial totally acyclic modules.

Commutative Algebra · Mathematics 2019-05-07 Adela Vraciu

We show that the $p$-adic valuation of the sequence of Fibonacci numbers is a $p$-regular sequence for every prime $p$. For $p \neq 2, 5$, we determine that the rank of this sequence is $\alpha(p) + 1$, where $\alpha(m)$ is the restricted…

Number Theory · Mathematics 2015-10-15 Luis A. Medina , Eric Rowland

The aim of this paper is to give linear independence results for the values of certain series. As an application, we derive arithmetical properties of the sums of reciprocals of Fibonacci and Lucas numbers associated with certain coprime…

Number Theory · Mathematics 2019-08-21 Daniel Duverney , Yuta Suzuki , Yohei Tachiya

A residuated lattice is defined to be integrally closed if it satisfies the equations x\x = e and x/x = e. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed…

Logic · Mathematics 2019-11-18 José Gil-Férez , Frederik Lauridsen , George Metcalfe

This paper proposes a computational method for obtaining the length of the cycle that arises from the Fibonacci series taken mod m (some number) and mod p (some prime number).

Other Computer Science · Computer Science 2011-11-09 Louis Mello