Primes as Sums of Fibonacci Numbers

Michael Drmota; Clemens Müllner; Lukas Spiegelhofer

Primes as Sums of Fibonacci Numbers

Titel in Übersetzung: Darstellung von Primzahlen als Summe von Fibonacci-Zahlen

Michael Drmota
, Clemens Müllner
, Lukas Spiegelhofer

Lehrstuhl für Mathematik, Statistik und Geometrie (380)

Technische Universität Wien

Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Begutachtung

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.

Titel in Übersetzung	Darstellung von Primzahlen als Summe von Fibonacci-Zahlen
Originalsprache	Englisch
Seitenumfang	138
Fachzeitschrift	Memoirs of the American Mathematical Society
Jahrgang	2025
Ausgabenummer	Volume 1537
Publikationsstatus	Veröffentlicht - 2025

Zugriff auf Dokument

https://arxiv.org/abs/2109.04068Lizenz: Andere

Andere Dateien und Links

https://doi.org/10.1090/memo/1537

Dieses zitieren

@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 = "Michael Drmota and Clemens M{\"u}llner and Lukas Spiegelhofer",

year = "2025",

language = "English",

volume = "2025",

journal = "Memoirs of the American Mathematical Society",

issn = "0065-9266",

publisher = "American Mathematical Society",

number = " Volume 1537",

}

TY - JOUR

T1 - Primes as Sums of Fibonacci Numbers

AU - Drmota, Michael

AU - Müllner, Clemens

AU - Spiegelhofer, Lukas

PY - 2025

Y1 - 2025

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

UR - https://doi.org/10.1090/memo/1537

M3 - Article

SN - 0065-9266

VL - 2025

JO - Memoirs of the American Mathematical Society

JF - Memoirs of the American Mathematical Society

IS - Volume 1537

ER -