<p>Let <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(k\ge 2\)</EquationSource> </InlineEquation> be an integer. The <i>k</i>-generalized Pell sequence <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\((P_{n}^{(k)})_{n\ge 2-k}\)</EquationSource> </InlineEquation> is defined by the initial values <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(0,0,\ldots ,0,1\)</EquationSource> </InlineEquation>(<i>k</i> terms) and the recurrence <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\ldots +P_{n-k}^{(k)}\)</EquationSource> </InlineEquation> for all <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(n\ge 2\)</EquationSource> </InlineEquation>. In this study, we deal with the Diophantine equation <Equation ID="Equ35"> <EquationSource Format="TEX">\(P_{n}^{(k)}P_{m}^{(k)}=d\left( \frac{b^{l}-1}{b-1}\right)\)</EquationSource> </Equation>in positive integers <i>n</i>,&#xa0;<i>m</i>,&#xa0;<i>k</i>,&#xa0;<i>b</i>,&#xa0;<i>d</i>,&#xa0;<i>l</i> with <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(k\ge 3,l\ge 2,~2\le m\le n,\)</EquationSource> </InlineEquation> <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(2\le b\le 10,\)</EquationSource> </InlineEquation> and <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(1\le d\le b-1,\)</EquationSource> </InlineEquation> and we show that all solutions of this equation are given by <Equation ID="Equ36"> <EquationSource Format="TEX">\(\begin{aligned} P_{2}^{(k)}P_{2}^{(k)}&amp;=(11)_{3},~P_{3}^{(k)}P_{2}^{(k)}=(22)_{4}=(11)_{9}\text {, }P_{4}^{(k)}P_{2}^{(k)}=(222)_{3}\text { for }k\ge 3,\\ P_{5}^{(k)}P_{3}^{(k)}&amp;=(2222)_{4}\text { for }k\ge 4, \end{aligned}\)</EquationSource> </Equation>and <Equation ID="Equ37"> <EquationSource Format="TEX">\(P_{5}^{(3)}P_{2}^{(3)}=\left( 66\right) _{10}.\)</EquationSource> </Equation></p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Repdigits in base b as product of two k-generalized Pell numbers

  • Zafer Şiar

摘要

Let \(k\ge 2\) be an integer. The k-generalized Pell sequence \((P_{n}^{(k)})_{n\ge 2-k}\) is defined by the initial values \(0,0,\ldots ,0,1\) (k terms) and the recurrence \(P_{n}^{(k)}=2P_{n-1}^{(k)}+P_{n-2}^{(k)}+\ldots +P_{n-k}^{(k)}\) for all \(n\ge 2\) . In this study, we deal with the Diophantine equation \(P_{n}^{(k)}P_{m}^{(k)}=d\left( \frac{b^{l}-1}{b-1}\right)\) in positive integers nmkbdl with \(k\ge 3,l\ge 2,~2\le m\le n,\) \(2\le b\le 10,\) and \(1\le d\le b-1,\) and we show that all solutions of this equation are given by \(\begin{aligned} P_{2}^{(k)}P_{2}^{(k)}&=(11)_{3},~P_{3}^{(k)}P_{2}^{(k)}=(22)_{4}=(11)_{9}\text {, }P_{4}^{(k)}P_{2}^{(k)}=(222)_{3}\text { for }k\ge 3,\\ P_{5}^{(k)}P_{3}^{(k)}&=(2222)_{4}\text { for }k\ge 4, \end{aligned}\) and \(P_{5}^{(3)}P_{2}^{(3)}=\left( 66\right) _{10}.\)