4. CONCLUSION
7The work on higher order cobalancing numbers is related to some
classical unsolved problem in Diophantine equations. In this context we recall
the works of Bernstein (see [2], [3] and [4]) on pyramidal Diophantine
equations. These works, in turn, are particular cases of a problem due to
Ërdös [6], namely whether the Diophantine equation
m(m+1)(m+2)...(m+k −1) =2n(n +1)(n +2)...(n +k −1)
has any solution for k > 2 and m+ k +1< n. Makowski [9] answered Ërdös’
question in the negative for a particular case with the use of results of Segal
[13]. The existence of cobalancing squares is equivalent to the existence of
solution to the Diophantine equation
m(m+1)(m+2) =2n(n+1)(n+2),
which is a particular case of the previous Diophantine equation. Mordell [10]
looked at particular cases of nearly pyramidal numbers (i.e. any number
differing from a pyramidal number by 1) as did Boyd and Kisilevsky [5], but
the scope of generalization is wide open.
Acknowledgement: It is a pleasure to thank the anonymous referee and
Professor Curtis Cooper, Editor, The Fibonacci Quarterly for their valuable
comments and suggestions that greatly improved the presentation of the
paper.
4. CONCLUSION7The work on higher order cobalancing numbers is related to someclassical unsolved problem in Diophantine equations. In this context we recallthe works of Bernstein (see [2], [3] and [4]) on pyramidal Diophantineequations. These works, in turn, are particular cases of a problem due toËrdös [6], namely whether the Diophantine equation m(m+1)(m+2)...(m+k −1) =2n(n +1)(n +2)...(n +k −1)has any solution for k > 2 and m+ k +1< n. Makowski [9] answered Ërdös’question in the negative for a particular case with the use of results of Segal[13]. The existence of cobalancing squares is equivalent to the existence ofsolution to the Diophantine equationm(m+1)(m+2) =2n(n+1)(n+2),which is a particular case of the previous Diophantine equation. Mordell [10]looked at particular cases of nearly pyramidal numbers (i.e. any numberdiffering from a pyramidal number by 1) as did Boyd and Kisilevsky [5], butthe scope of generalization is wide open. Acknowledgement: It is a pleasure to thank the anonymous referee andProfessor Curtis Cooper, Editor, The Fibonacci Quarterly for their valuablecomments and suggestions that greatly improved the presentation of thepaper.
การแปล กรุณารอสักครู่..
