Related papers: Memoir on Divisibility Sequences
Inspired by Lehmer's and Deaconescu's conjectures, as well as various analogue problems concerning Euler's totient function $\varphi(n)$, Schemmel's totient function $S_{2}(n)$, Jordan totient function $J_k$, and the unitary totient…
We consider a certain linear recursive relation with integer parameters and study some of its algebraic and geometric properties, with the purpose of estimating the number of chains of valences in the Farey series.
We study the divisibility of the sums of the odd power of consecutive integers, $S(m,k)=1^{mk}+2^{mk}+\cdots+k^{mk}$ and $1^k+2^k+\cdots+n^k$ for odd integers $m$ and $k$, by using the Girard-Waring identity. Faulhaber's approach for the…
In this paper we study the sets of integers which are $n$-th terms of Lucas sequences. We establish lower- and upper bounds for the size of these sets. These bounds are sharp for $n$ sufficiently large. We also develop bounds on the growth…
We investigate strong divisibility sequences and produce lower and upper bounds for the density of integers in the sequence which only have (somewhat) large prime factors. We focus on the special cases of Fibonacci numbers and elliptic…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
A divisibility sequence is a sequence of integers $\{d_n\}$ such that $d_m$ divides $d_n$ if $m$ divides $n$. Results of Bugeaud, Corvaja, Zannier, among others, have shown that the gcd of two divisibility sequences corresponding to…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
In 2012, Diem introduced a new figure of merit for cryptographic sequences called expansion complexity. Recently, a series of paper has been published for analysis of expansion complexity and for testing sequences in terms of this new…
We believe we have made progress in the age-old problem of divisibility rules for integers. Universal divisibility rule is introduced for any divisor in any base number system. The divisibility criterion is written down explicitly as a…
Much has been written on reciprocity laws in number theory and their connections with group representations. In this paper we explore more on these connections. We prove a "reciprocity Law" for certain specific representations of semidirect…
Statistical laws describe regular patterns observed in diverse scientific domains, ranging from the magnitude of earthquakes (Gutenberg-Richter law) and metabolic rates in organisms (Kleiber's law), to the frequency distribution of words in…
We give a new characterization of generalized B\"uchi sequences (sequences whose sequence of squares has constant second difference $(a)$, for some fixed integer $a$) of length 3 over the integers and a strategy for attacking B\"uchi's n…
In our previous work [CMS24] we defined a new class of enumerative invariants called $k$-leaky double Hurwitz descendants, generalizing both descendant integrals of double ramification cycles and $k$-leaky double Hurwitz numbers. Here, we…
Rationals are known to form interesting and computationally rich structures, such as Farey sequences and infinite trees. Little attention is being paid to more general, systematic exposition of the basic properties of fractions as a set.…
Considering homogeneous and oscillating random walks on the integers, we simplify classical works on recurrence of Spitzer and Kemperman, respectively. Some links with renewal theory are discussed.
This paper describes a simple method for estimating lower bounds on the number of classes of equivalence for a special kind of integer sequences, called division sequences. The method is based on adding group structure to classes of…
This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…
We study the properties of the third order sequence $(w_n)=\left(w_n(a,b,c; r, s,t)\right)$ defined by the recurrence relation $w_n = rw_{n - 1} + sw_{n - 2} + tw_{n - 3}\, (n \ge 3)$ with $w_0 = a,\,w_1 = b,\,w_2=c$, where $a$, $b$, $c$,…
We derive an identity connecting any two second-order linear recurrence sequences having the same recurrence relation but whose initial terms may be different. Binomial and ordinary summation identities arising from the identity are…