For Lucas-balancing numbers Cn,the integer solutions of the Diophantine equation Cn=2a+3b+5c+7d,0 ≤ max { a,b,c} ≤ d were considered.By using the Matveev's theorem and the reduction method,it was obtained that the only solution of the equation is(n,a,b,c,d)=(2,1,1,1,1).
关键词
卢卡斯平衡数/平衡数/对数高/Binet公式
Key words
Lucas-balancing numbers/balancing numbers/logarithmic height/Binet formula