Related papers: Almost Repdigits in $ k-$generalized Lucas Sequenc…

For positive integers $b\geq 2$, $k<b$, and $t$, we say that an integer $k_b^{(t)}$ is a $b$-repdigit if $k_b^{(t)}$ can be expressed as the digit $k$ repeated $t$ times in base-$b$ representation, i.e., $k_b^{(t)} =k(b^t-1)/(b-1)$. In the…

This paper provides a complete solution to Skolem's problem for the $k$-generalized Lucas sequence $(L_n^{(k)})_{n \in \mathbb{Z}}$ with a primary focus on its behavior at negative indices. We characterize the zero-distribution of this…

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 afterwards is the sum of the preceding $k$ terms. In this paper, we…

Let $b$ be a positive integer such that $2 \leq b \leq 10$. In this study, we find all Pell or Pell-Lucas numbers as concatenations of two repdigits in base $b$. As a corollary, it is show that the largest Pell or Pell-Lucas numbers which…

We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 =1=P_2$ and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\geq 0 $. In this paper, we find all repdigits in base $ 10 $ which can be written as a sum of three…

In this paper, we prove a necessary and sufficient condition for the Lucas-Carmichael integers in terms of the sum of base-$p$ digits. We also study some interesting properties of such integers. Finally, we prove that there are infinitely…

Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…

In this note we associate a sequence of non-negative integers to any convergent series of positive real numbers and study this sequence for the series $\sum_{n \geq 1} n^{-k}$ where $k$ is an integer $\geq 2$.

A natural number $n$ is called a repdigit if all its digits are same. In this paper, we prove that Euler totient function of no Pell number is a repdigit with at least two digits. This study is also extended to certain subclass of…

A positive integer $n$ is called a balancing number if there exists a positive integer $r$ such that $1 + 2 + \cdots + (n-1) = (n+1) + (n+2) + \cdots + (n+r)$. The corresponding value $r$ is known as the balancer of $n$. If $n$ is a…

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

For $A,B\in\mathbb Z$, the Lucas sequence $u_n(A,B)\ (n=0,1,2,\ldots)$ are defined by $u_0(A,B)=0$, $u_1(A,B)=1$, and $u_{n+1}(A,B) = Au_n(A,B)-Bu_{n-1}(A,B)$ $(n=1,2,3,\ldots).$ For any odd prime $p$ and positive integer $n$, we establish…

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Pell numbers defined by $ P_0=0 $, $ P_1 =1$ and $ P_{n+2}= 2P_{n+1} +P_n$ for all $ n\geq 0 $ and let $ \{Q_{n}\}_{n\geq 0} $ be its companion sequence, the Pell-Lucas numbers defined by $…

For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…

Let $ k \geq 2 $ be an integer. The $ k- $generalized Fibonacci sequence is a sequence defined by the recurrence relation $ F_{n}^{(k)}=F_{n-1}^{(k)} + \cdots + F_{n-k}^{(k)}$ for all $ n \geq 2$ with the initial values $ F_{i}^{(k)}=0 $…

For an arbitrary integer $x$, an integer of the form $T(x)=\frac{x^2+x}{2}$ is called a triangular number. For positive integers $\alpha_1,\alpha_2,\dots,\alpha_k$, a sum…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

Sums over inverse s-th powers of semiprimes and k-almost primes are transformed into sums over products of powers of ordinary prime zeta functions. Multinomial coefficients known from the cycle decomposition of permutation groups play the…

We say that an arithmetical function $S:\mathbb{N}\rightarrow\mathbb{Z}$ has Lucas property if for any prime $p$, \begin{equation*} S(n)\equiv S(n_{0})S(n_{1})\ldots S(n_{r})\pmod p, \end{equation*} where $n=\sum_{i=0}^{r}n_{i}p^{i}$, with…