Código QR (código de barras bidimensional)

On $k$-Fibonacci balancing and $k$-Fibonacci Lucas-balancing numbers

The balancing number $n$ and the balancer $r$ are solution of the Diophantine equation $$1+2+\cdots+(n-1) = (n+1)+(n+2)+\cdots+(n+r). $$ It is well known that if $n$ is balancing number, then $8n^2 + 1$ is a perfect square and its positive square root is called a Lucas-balancing number. For an integ...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Hovedforfatter: S.E. Rihane
Format: Artigo
Sprog:Inglês
Udgivet: Vasyl Stefanyk Precarpathian National University 2021-06-01
Serier:Karpatsʹkì Matematičnì Publìkacìï
Fag:
Online adgang:https://journals.pnu.edu.ua/index.php/cmp/article/view/4410
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!