Greatest common divisors of shifted balancing numbers
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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática
2017-10-01
|
| Series: | Boletim da Sociedade Paranaense de Matemática |
| Subjects: | |
| Online Access: | http://periodicos.uem.br/ojs/index.php/BSocParanMat/article/view/26093 |