Searcharxiv⌕ Search

arXiv subjects

Carlos A. Gómez

Publications and source records attributed to Carlos A. Gómez.

5 recordsLinked to original sources
arXiv2026

$k$--Fibonacci numbers with two blocks of repdigits

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms. In this paper, we find all $k$--Fibonacci numbers that are concatenations of two repdigits. This generalizes prior results which dealt with the above problem for the particular cases of Fibonacci and Tribonacci numbers.

math.NT↗
arXiv2017

On a problem of Pillai with $k$-generalised Fibonacci numbers and powers of $2$

For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized 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 find all integers $c$ having at least two representations as a difference between a $k$--generalized Fibonacci number and a powers of 2 for any fixed $k \geqslant 4$. This paper extends previous work from [9] for the case $k=2$ and [6] for the case $k=3$.

math.NT↗
arXiv2014

$B_{h}[g]$ modular sets from $B_{h}$ modular sets

A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this kind of sets, is to find $B_{h}[g]$ maximal sets i.e. those with larger cardinality. We construct $B_{h}[g]$ modular sets from $B_{h}$ modular sets using homomorphisms and analyze the constructions of $B_{h}$ sets by Bose and Chowla, Ruzsa, and Gómez and Trujillo look at for the suitable homomorphism that allows us to preserve the cardinal of this types of sets.

math.NT↗
arXiv2014

Powers of two as sums of two $k-$Fibonacci numbers

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 sums of two $k-$Fibonacci numbers. The main tools used in this work are lower bounds for linear forms in logarithms and a version of the Baker--Davenport reduction method in diophantine approximation. This paper continues and extends the previous work of \cite{BL2} and \cite{BL13}.

math.NT↗