相关论文: Repdigits in k-generalized Pell sequence

Repdigits are natural numbers formed by the repetition of a single digit. In this paper, we study the problem of writing repdigits as the difference of two balancing or Lucas-balancing numbers. The method of proof involves the application…

Let $(L_n^{(k)})_{n\geq 2-k}$ be the sequence of $k$-generalized Lucas numbers for some fixed integer $k\ge 2$, whose first $k$ terms are $0,\;\ldots\;,\;0,\;2,\;1$ and each term afterward is the sum of the preceding $k$ terms. In this…

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that…

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

Let $T_{k}$ be the $k^{\textrm{th}}$ Tribonacci number and $L_{n}$ be the $n^{\textrm{th}}$ Lucas number defined by their respective recurrence relation $T_{k}=T_{k-1}+T_{k-2}+T_{k-3}$ and $L_{n}=L_{n-1}+L_{n-2}$. In this study, we solve…

In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+…

We investigate the solvability of the Diophantine equation $x^2-my^2=\pm p$ in integers for certain integer $m$ and prime $p$. Then we apply these results to produce family of maximal real subfield of a cyclotomic field whose class number…

A \emph{repdigit} is a natural number greater than 10 which has all of its base-10 digits the same. In this paper we find all examples of two repdigits adding to a square. The proofs lead to interesting questions about consecutive quadratic…

The aim of this expository article is twofold. The first is to introduce several polynomials of one variable as well as two variables defined on the positive integers with values as congruent numbers. The second is to present connections…

In this paper, we define k-generalized order-k numbers and we obtain a relation between i-th sequences and k-th sequences of k-generalized order-k numbers. We give some determinantal and permanental representations of k-generalized order-k…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$…

In this study, we find continued fraction expansion of sqrt(d) when d=a^2b^2-b and d=a^2b^2-2b where a and b are positive integers. We consider the integer solutions of the Pell equations x^2-(a^2b^2-b)y^2=N and x^2-(a^2b^2-2b)y^2=N when N…

In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…

We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…

We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

Positive integers with all digits equal are called repdigits. In this paper, we find all balancing and Lucas-balancing numbers, which can be expressed as the difference of two repdigits. The method of proof involves the application of…

It has long been known that sequences such as the powers of $2$ and the factorials satisfy Benford's Law; that is, leading digits in these sequences occur with frequencies given by $P(d)=\log_{10}(1+1/d)$, $d=1,2,\dots,9$. In this paper, we…

For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $ k $ preceding terms. In this paper,…