English
Related papers

Related papers: Fibonacci system and residue completeness

200 papers

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

Number Theory · Mathematics 2021-08-10 Carlo Sanna

Let F(n) be a polynomial of degree at least 2 with integer coefficients. We consider the products N_x=\prod_{1 \le n \le x} F(n) and show that N_x should only rarely be a perfect power. In particular, the number of x \le X for which N_x is…

Number Theory · Mathematics 2011-07-12 Paul Spiegelhalter , Joseph Vandehey

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

Computational Complexity · Computer Science 2012-04-18 S. Jukna , G. Schnitger

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

Statistical Mechanics · Physics 2009-11-07 Clément Sire , Paul L. Krapivsky

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

It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…

Number Theory · Mathematics 2020-01-08 Qunying Liao , Yuanbo Liu

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

Number Theory · Mathematics 2014-09-15 Romeo Meštrović

A residuated semigroup is a structure $\langle A,\le,\cdot,\backslash,/ \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot \rangle$ is a semigroup such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le x…

Logic in Computer Science · Computer Science 2025-05-20 Stefano Bonzio , José Gil-Férez , Peter Jipsen , Adam Přenosil , Melissa Sugimoto

Fibonacci-like polynomials produced by m-ary Huffman codes for absolutely ordered sequences have been described.

Discrete Mathematics · Computer Science 2007-05-23 Alex Vinokur

We calculate exact values of the decycling numbers of $C_{m} \times C_{n}$ for $m=3,4$, of $C_{n}^{2}$, and of $C_{n}^{3}$.

Combinatorics · Mathematics 2007-06-05 Adrian Riskin

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

Number Theory · Mathematics 2022-02-22 Pagdame Tiebekabe , Ismaïla Diouf

We introduce a new real valued invariant for finitely presented groups called residual deficiency. Its main property is the following. Let G be a finitely presented group. If the residual deficiency of G is greater than one, then G has a…

Group Theory · Mathematics 2013-06-12 Mariano Zeron-Medina Laris

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

Probability · Mathematics 2023-12-06 Jnaneshwar Baslingker , Biltu Dan

An integer sequence $(a_n)_{n \in \mathbb{N}}$ is \emph{MC-finite} if for all $m$, the sequence $a_n \bmod m$ is eventually periodic. There are MC-finite sequences $(a_n)_{n \in \mathbb{N}}$ such that the function $F: (m,n) \mapsto a_n…

Combinatorics · Mathematics 2025-02-17 Yuval Filmus , Eldar Fischer , Johann A. Makowsky

In this paper, we find all sums of two Fibonacci numbers which are close to a power of 2. As a corollary, we also determine all Lucas numbers close to a power of 2. The main tools used in this work are lower bounds for linear forms in…

Number Theory · Mathematics 2022-06-22 Elchin Hasanalizade

We study Fibonacci compositions, which are compositions of natural numbers that only use Fibonacci numbers, in two different contexts. We first prove inequalities comparing the number of Fibonacci compositions to regular compositions where…

Number Theory · Mathematics 2022-11-29 Joshua M. Siktar

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

Number Theory · Mathematics 2018-08-09 Kunle Adegoke

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

Number Theory · Mathematics 2022-09-22 Evan M. O'Dorney

Output stabilizability of a class of infinite dimensional linear systems is studied in this paper. A criterion for the system to be output stabilizable by a linear bounded feedback $u=Fx$, $F\in L(Z,\mathbb{R}^{^{p}})$ will be given.

Optimization and Control · Mathematics 2014-08-08 Faouzi Haddouchi

Suppose that $M$ is a finitely-generated graded module of codimension $c\geq 3$ over a polynomial ring and that the regularity of $M$ is at most $2a-2$ where $a\geq 2$ is the minimal degree of a first syzygy of $M$. Then we show that the…

Commutative Algebra · Mathematics 2019-10-29 Adam Boocher , Derrick Wigglesworth