English
Related papers

Related papers: Counting base phi representations

200 papers

We give a simple recursive formula to obtain the general sum of the first $N$ natural numbers to the $r$th power. Our method allows one to obtain the general formula for the $(r+1)$th power once one knows the general formula for the $r$th…

General Mathematics · Mathematics 2022-03-29 Alessandro Mariani

Expansions in the Golden ratio base have been studied since a pioneering paper of R\'enyi more than sixty years ago. We introduce closely related expansions of a new type, based on the Fibonacci sequence, and we show that in some sense they…

Number Theory · Mathematics 2021-02-25 Claudio Baiocchi , Vilmos Komornik , Paola Loreti

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Combinatorics · Mathematics 2023-03-22 Cristina Ballantine , George Beck

In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…

In the present paper the authors construct normal numbers in base $q$ by concatenating $q$-adic expansions of prime powers $\lfloor\alpha p^\theta\rfloor$ with $\alpha>0$ and $\theta>1$.

Number Theory · Mathematics 2013-11-22 Manfred G. Madritsch , Robert F. Tichy

For an integer $k\ge 2$, let $\{F^{(k)}_{n}\}_{n\ge 2-k}$ be the $ k$--generalized Fibonacci sequence which starts with $0, \ldots, 0,1$ (a total of $k$ terms) and for which each term afterwards is the sum of the $k$ preceding terms. In…

Number Theory · Mathematics 2020-04-28 Mahadi Ddamulira , Florian Luca

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

Number Theory · Mathematics 2016-07-14 Joseph Vandehey

The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded in the study of numerical sets, we provide a direct, short…

Combinatorics · Mathematics 2026-05-22 Stefan Weltge , Konrad Zyhalko

We consider both finite and infinite power chi expansions of $f$-divergences derived from Taylor's expansions of smooth generators, and elaborate on cases where these expansions yield closed-form formula, bounded approximations, or analytic…

Information Theory · Computer Science 2019-03-15 Frank Nielsen , Gaëtan Hadjeres

We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…

Number Theory · Mathematics 2015-09-01 Michelle Rudolph-Lilith

This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…

Number Theory · Mathematics 2022-12-16 Magdaléna Tinková

For $\alpha>1$ we represent a real number in $(0,1]$ in the form \[ \sum_{i=1}^{\infty}(\alpha-1)^{i-1}\alpha^{-(d_{1}+\dots+d_{i})}\] with $d_{i}\in\mathbb{N}$. We discuss ergodic theoretical and dimension theoretical aspects of this…

Dynamical Systems · Mathematics 2024-06-18 Jörg Neunhäuserer

By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…

Combinatorics · Mathematics 2020-10-29 Oktay K. Pashaev , Merve Ozvatan

Let A be a set of integers. For every integer n, let r_{A,h}(n) denote the number of representations of n in the form n = a_1 + a_2 + ... + a_h, where a_1, a_2,...,a_h are in A and a_1 \leq a_2 \leq ... \leq a_h. The function r_{A,h}: Z \to…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

Number Theory · Mathematics 2022-03-29 Ramanujam Kamaraj , Ben Kane , Ryoko Tomiyasu

We study $\alpha$-adic expansions of numbers in an extension field, that is to say, left infinite representations of numbers in the positional numeration system with the base $\alpha$, where $\alpha$ is an algebraic conjugate of a Pisot…

Number Theory · Mathematics 2007-05-23 P. Ambroz , C. Frougny

Let $q$ be a perfect power of a prime number $p$ and $E({\mathbb F}_q)$ be an elliptic curve over ${\mathbb F}_q$ given by the equation $y^2=x^3+Ax+B$. For a positive integer $n$ we denote by $ \# E({\mathbb F}_{q^n})$ the number of…

Number Theory · Mathematics 2020-03-24 Kwok Chi Chim , Florian Luca

Let $ \{F_n\}_{n\ge 0} $ be the sequence of Fibonacci numbers and let $p$ be a prime. For an integer $c$ we write $m_{F,p}(c)$ for the number of distinct representations of $c$ as $F_k-p^\ell$ with $k\ge 2$ and $\ell\ge 0$. We prove that…

Number Theory · Mathematics 2022-07-27 Herbert Batte , Mahadi Ddamulira , Juma Kasozi , Florian Luca

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

Number Theory · Mathematics 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

Simplification of fractional powers of positive rational numbers and of sums, products and powers of such numbers is taught in beginning algebra. Such numbers can often be expressed in many ways, as this article discusses in some detail.…

Symbolic Computation · Computer Science 2013-02-12 Albert D. Rich , David R. Stoutemyer
‹ Prev 1 3 4 5 6 7 10 Next ›