Curious congruences for balancing numbers (Q2911296)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6081699
Language Label Description Also known as
default for all languages
No label defined
    English
    Curious congruences for balancing numbers
    scientific article; zbMATH DE number 6081699

      Statements

      0 references
      12 September 2012
      0 references
      balancing numbers
      0 references
      balancers
      0 references
      Lucas-balancing numbers
      0 references
      recurrence relation
      0 references
      Curious congruences for balancing numbers (English)
      0 references
      A positive integer \(n\) is called \textit{co-balancing number} if NEWLINE\[NEWLINE 1+2+\dots+n=(n+1)+(n+2)+\dots+(n+r) NEWLINE\]NEWLINE for some positive integer \(r\) called the \textit{co-balancer} and \textit{balancing number} if NEWLINE\[NEWLINE 1+2+\dots+(n-1)=(n+1)+(n+2)+\dots+(n+r) NEWLINE\]NEWLINE where \(r\) is called \textit{balancer}.NEWLINENEWLINESince the first paper published on balancing numbers by A. Behera and G. K. Panda several authors dealt with this topic and gave new generalizations of balancing or co-balancing numbers. In this article the author deals with the topic of sequence of balancing numbers and gives some fascinating congruences involving other related (e.g. Lucas) numbers.NEWLINENEWLINEThe author proves several interesting results on balancing \(B_n\) and Lucas-balancing numbers \(C_n\). A few of them are listed below. For more details see the original article.NEWLINENEWLINETheorem 2.3. Let \(m\) and \(n\) be positive integers. Then \((B_m,B_n)= B_{(m,n)}.\)NEWLINENEWLINENEWLINETheorem 3.1. If \(p\) is an odd prime, then \(C_p\equiv 3 \pmod p\), \(B_p\equiv \left(\frac{p}{8}\right) \pmod p\).NEWLINENEWLINENEWLINETheorem 3.9. For any positive integer \(m\), \( B_{2m}\equiv 0 \pmod {C_m},\quad B_{2m-1}\equiv 1 \pmod {C_m}\).
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references