Primes as Sums of Fibonacci Numbers

Lukas Spiegelhofer; Michael Drmota; Clemens Müllner

Primes as Sums of Fibonacci Numbers

Lukas Spiegelhofer, Michael Drmota, Clemens Müllner

Chair of Mathematics, Statistics and Geometry (380)

Institute of Materials Science and Technology

Research output: Contribution to journal › Article › Research › peer-review

Abstract

We prove that, for a large enough integer k, there exist prime numbers that are the sum of exactly k different, non-consecutive Fibonacci numbers.
Along the way, we prove that the level of distribution of the Zeckendorf sum-of-digits function equals 1.

Translated title of the contribution	Darstellung von Primzahlen als Summe von Fibonacci-Zahlen
Original language	English
Number of pages	135
Journal	Memoirs of the American Mathematical Society
Publication status	Accepted/In press - 1 Sept 2022

Keywords

prime numbers
Fibonacci numbers
level of distribution

Access to Document

https://arxiv.org/abs/2109.04068Licence: Other

Cite this

@article{4ec0f561aa814528a8e24ef9122aabf8,

title = "Primes as Sums of Fibonacci Numbers",

abstract = "We prove that, for a large enough integer k, there exist prime numbers that are the sum of exactly k different, non-consecutive Fibonacci numbers.Along the way, we prove that the level of distribution of the Zeckendorf sum-of-digits function equals 1.",

keywords = "prime numbers, Fibonacci numbers, level of distribution",

author = "Lukas Spiegelhofer and Michael Drmota and Clemens M{\"u}llner",

year = "2022",

month = sep,

day = "1",

language = "English",

journal = "Memoirs of the American Mathematical Society",

issn = "0065-9266",

publisher = "American Mathematical Society",

}

TY - JOUR

T1 - Primes as Sums of Fibonacci Numbers

AU - Spiegelhofer, Lukas

AU - Drmota, Michael

AU - Müllner, Clemens

PY - 2022/9/1

Y1 - 2022/9/1

N2 - We prove that, for a large enough integer k, there exist prime numbers that are the sum of exactly k different, non-consecutive Fibonacci numbers.Along the way, we prove that the level of distribution of the Zeckendorf sum-of-digits function equals 1.

AB - We prove that, for a large enough integer k, there exist prime numbers that are the sum of exactly k different, non-consecutive Fibonacci numbers.Along the way, we prove that the level of distribution of the Zeckendorf sum-of-digits function equals 1.

KW - prime numbers

KW - Fibonacci numbers

KW - level of distribution

M3 - Article

SN - 0065-9266

JO - Memoirs of the American Mathematical Society

JF - Memoirs of the American Mathematical Society

ER -