Let p ≥ 5 be prime, and let g(2n, p) denote the number of unordered representations
by positive integers
2n = h + k, h ≤ k, gcd(h, 6p) = gcd(k, 6p) = 1.
Every positive integer coprime to 6 belongs to exactly one of the families 6z + 1 and
6z + 5. In each family, divisibility by p excludes one explicit residue class of...
Andres Salazar· Communications on Number The...· 2 citations
In a recent paper of the same title, we considered nondistinct partitions of integers over the Fibonacci sequence and related linearly recurrent sequences. In this paper, continuing this story, we apply the same method, but consider distinct partitions. In particular, let $q_F(m)$ denote the number of ways of writing $...
M. Coons, S. Kristensen, M. L. Laursen· 0 citations
We study the recurrence C(n)=C(n-1)+C(n-2)+gcd(C(n-1),C(n-2)) through its states, the coprime pairs obtained by dividing consecutive terms by their gcd. A step is an amplification when this gcd grows, and once the states reach a cycle the sequence grows exactly geometrically. The author’s earlier work left open whether...
M. Hawarey· AIR Journal of Mathematics a...· 0 citations
Zeckendorf proved that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Among its extensions, we focus on Positive Linear Recurrence Sequences (PLRS): fixed depth recurrences with non-negative integral coefficients whose first and last terms are positive: $G_{n+1} = c_1 G_n...
Yin-Xi Chen, Zong-Yun Chen, Brian Hii et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.