Greatest common divisors of shifted balancing numbers
Resumen
It is well known that the successive balancing numbers are relatively prime. Let for all integers a, sn(a) denotes the greatest common divisor of the shifted balancing numbers of the form sn(a) = gcd(Bn a; Bn+1 6a).
In this study, we will show that fsn(1)g is unbounded whereas fsn(a)g is
bounded for a 6= 1.
Descargas
La descarga de datos todavía no está disponible.
Publicado
2016-10-25
Número
Sección
Research Articles
When the manuscript is accepted for publication, the authors agree automatically to transfer the copyright to the (SPM).
The journal utilize the Creative Common Attribution (CC-BY 4.0).