Representing Numbers Using Fibonacci Variants

2015 ◽  
Author(s):  
Stephen K. Lucas
Keyword(s):  
Natural Number ◽  
Greedy Algorithm ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Fixed Number ◽  
Natural Numbers ◽  
Form Versus ◽  
Entire Number

This chapter introduces the Zeckendorf representation of a Fibonacci sequence, a form of a natural number which can be easily found using a greedy algorithm: given a number, subtract the largest Fibonacci number less than or equal to it, and repeat until the entire number is used up. This chapter first compares the efficiency of representing numbers using Zeckendorf form versus traditional binary with a fixed number of digits and shows when Zeckendorf form is to be preferred. It also shows what happens when variants of Zeckendorf form are used. Not only can natural numbers as be presented sums of Fibonacci numbers, but arithmetic can also be done with them directly in Zeckendorf form. The chapter includes a survey of past approaches to Zeckendorf representation arithmetic, as well as some improvements.

scholarly journals On Integer Numbers with Locally Smallest Order of Appearance in the Fibonacci Sequence

2011 ◽  
Vol 2011 ◽  
pp. 1-4 ◽  
Author(s):  
Diego Marques
Keyword(s):  
Natural Number ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Natural Numbers

LetFnbe thenth Fibonacci number. The order of appearancez(n)of a natural numbernis defined as the smallest natural numberksuch thatndividesFk. For instance, for alln=Fm≥5, we havez(n−1)>z(n)<z(n+1). In this paper, we will construct infinitely many natural numbers satisfying the previous inequalities and which do not belong to the Fibonacci sequence.

scholarly journals On Diophantine Equations Related to Order of Appearance in Fibonacci Sequence

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1073 ◽  
Author(s):  
Pavel Trojovský
Keyword(s):  
Natural Number ◽  
Diophantine Equations ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Prime Numbers ◽  
All Solutions ◽  
Adic Valuation

Let F n be the nth Fibonacci number. Order of appearance z ( n ) of a natural number n is defined as smallest natural number k, such that n divides F k . In 1930, Lehmer proved that all solutions of equation z ( n ) = n ± 1 are prime numbers. In this paper, we solve equation z ( n ) = n + ℓ for | ℓ | ∈ { 1 , … , 9 } . Our method is based on the p-adic valuation of Fibonacci numbers.

THE FIBONACCI-NORM OF A POSITIVE INTEGER: OBSERVATIONS AND CONJECTURES

2010 ◽  
Vol 06 (02) ◽  
pp. 371-385 ◽  
Author(s):  
JEONG SOON HAN ◽  
HEE SIK KIM ◽  
J. NEGGERS
Keyword(s):  
Positive Integer ◽  
Natural Number ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Natural Numbers

In this paper, we define the Fibonacci-norm [Formula: see text] of a natural number n to be the smallest integer k such that n|Fk, the kth Fibonacci number. We show that [Formula: see text] for m ≥ 5. Thus by analogy we say that a natural number n ≥ 5 is a local-Fibonacci-number whenever [Formula: see text]. We offer several conjectures concerning the distribution of local-Fibonacci-numbers. We show that [Formula: see text], where [Formula: see text] provided Fm+k ≡ Fm (mod n) for all natural numbers m, with k ≥ 1 the smallest natural number for which this is true.

A characterization of lambda-terms transforming numerals

2016 ◽  
Vol 26 ◽  
Author(s):  
PAWEŁ PARYS
Keyword(s):  
Natural Number ◽  
Linear Transformation ◽  
Fixed Number ◽  
The Other ◽  
Natural Numbers ◽  
Data Types ◽  
Fixed Type ◽  
Intersection Types ◽  
The One

AbstractIt is well known that simply typed λ-terms can be used to represent numbers, as well as some other data types. We show that λ-terms of each fixed (but possibly very complicated) type can be described by a finite piece of information (a set of appropriately defined intersection types) and by a vector of natural numbers. On the one hand, the description is compositional: having only the finite piece of information for two closed λ-terms M and N, we can determine its counterpart for MN, and a linear transformation that applied to the vectors of numbers for M and N gives us the vector for MN. On the other hand, when a λ-term represents a natural number, then this number is approximated by a number in the vector corresponding to this λ-term. As a consequence, we prove that in a λ-term of a fixed type, we can store only a fixed number of natural numbers, in such a way that they can be extracted using λ-terms. More precisely, while representing k numbers in a closed λ-term of some type, we only require that there are k closed λ-terms M1,. . .,Mk such that Mi takes as argument the λ-term representing the k-tuple, and returns the i-th number in the tuple (we do not require that, using λ-calculus, one can construct the representation of the k-tuple out of the k numbers in the tuple). Moreover, the same result holds when we allow that the numbers can be extracted approximately, up to some error (even when we only want to know whether a set is bounded or not). All the results remain true when we allow the Y combinator (recursion) in our λ-terms, as well as uninterpreted constants.

The order of appearance of the sum and difference between two Fibonacci numbers

2019 ◽  
Vol 12 (03) ◽  
pp. 1950046 ◽  
Author(s):  
Pavel Trojovský
Keyword(s):  
Natural Number ◽  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Greatest Common Divisor ◽  
Lucas Number ◽  
Number Formula

Let [Formula: see text] be the [Formula: see text]th Fibonacci number and [Formula: see text] be the [Formula: see text]th Lucas number. The order of appearance [Formula: see text] of a natural number [Formula: see text] is defined as the smallest natural number [Formula: see text] such that [Formula: see text] divides [Formula: see text]. For instance, [Formula: see text], for all [Formula: see text]. In this paper, among other things, we prove that [Formula: see text] depends on [Formula: see text], where [Formula: see text] is the greatest common divisor of numbers [Formula: see text] and [Formula: see text], which fulfill the condition [Formula: see text].

scholarly journals On the problem of Pillai with k-generalized Fibonacci numbers and powers of 3

2020 ◽  
Vol 16 (07) ◽  
pp. 1643-1666
Author(s):  
Mahadi Ddamulira ◽  
Florian Luca
Keyword(s):  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Fibonacci Sequence ◽  
Generalized Fibonacci Numbers ◽  
Generalized Fibonacci Sequence ◽  
Tribonacci Numbers

For an integer [Formula: see text], let [Formula: see text] be the [Formula: see text]-generalized Fibonacci sequence which starts with [Formula: see text] (a total of [Formula: see text] terms) and for which each term afterwards is the sum of the [Formula: see text] preceding terms. In this paper, we find all integers [Formula: see text] with at least two representations as a difference between a [Formula: see text]-generalized Fibonacci number and a power of [Formula: see text]. This paper continues the previous work of the first author for the Fibonacci numbers, and for the Tribonacci numbers.

The Natural Numbers

2018 ◽  
Author(s):  
Øystein Linnebo
Keyword(s):  
Natural Number ◽  
Peano Arithmetic ◽  
Number Sequence ◽  
Natural Numbers ◽  
Ordinal Numbers ◽  
Cardinal Numbers

How are the natural numbers individuated? That is, what is our most basic way of singling out a natural number for reference in language or in thought? According to Frege and many of his followers, the natural numbers are cardinal numbers, individuated by the cardinalities of the collections that they number. Another answer regards the natural numbers as ordinal numbers, individuated by their positions in the natural number sequence. Some reasons to favor the second answer are presented. This answer is therefore developed in more detail, involving a form of abstraction on numerals. Based on this answer, a justification for the axioms of Dedekind–Peano arithmetic is developed.

scholarly journals On Fibonacci Numbers of Order r Which Are Expressible as Sum of Consecutive Factorial Numbers

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 962
Author(s):  
Eva Trojovská  ◽  
Pavel Trojovský
Keyword(s):  
Fibonacci Numbers ◽  
Fibonacci Number ◽  
Initial Values

Let (tn(r))n≥0 be the sequence of the generalized Fibonacci number of order r, which is defined by the recurrence tn(r)=tn−1(r)+⋯+tn−r(r) for n≥r, with initial values t0(r)=0 and ti(r)=1, for all 1≤i≤r. In 2002, Grossman and Luca searched for terms of the sequence (tn(2))n, which are expressible as a sum of factorials. In this paper, we continue this program by proving that, for any ℓ≥1, there exists an effectively computable constant C=C(ℓ)>0 (only depending on ℓ), such that, if (m,n,r) is a solution of tm(r)=n!+(n+1)!+⋯+(n+ℓ)!, with r even, then max{m,n,r}<C. As an application, we solve the previous equation for all 1≤ℓ≤5.

scholarly journals On the Sum of Powers of Two k-Fibonacci Numbers which Belongs to the Sequence of k-Lucas Numbers

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Lucas Numbers ◽  
Initial Values ◽  
Lucas Sequence ◽  
Positive Integers

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.

scholarly journals On Fibonacci Numbers and its Applications

2019 ◽  
Vol 8 (12) ◽  
pp. 453-455
Keyword(s):  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Generalized Fibonacci Sequence

In this article, we explore the representation of the product of k consecutive Fibonacci numbers as the sum of kth power of Fibonacci numbers. We also present a formula for finding the coefficients of the Fibonacci numbers appearing in this representation. Finally, we extend the idea to the case of generalized Fibonacci sequence and also, we produce another formula for finding the coefficients of Fibonacci numbers appearing in the representation of three consecutive Fibonacci numbers as a particular case. Also, we point out some amazing applications of Fibonacci numbers.

Sign in / Sign up

Export Citation Format

Share Document