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

The Gauss--Lucas theorem states that any convex set $K\subset\mathbb{C}$ which contains all $n$ zeros of a degree $n$ polynomial $p\in\mathbb{C}[z]$ must also contain all $n-1$ critical points of $p$. In this paper we explore the following…

In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…

A Lucas sequence is a sequence of the general form $v_n = (\phi^n - \bar{\phi}^n)/(\phi-\bar{\phi})$, where $\phi$ and $\bar{\phi}$ are real algebraic integers such that $\phi+\bar{\phi}$ and $\phi\bar{\phi}$ are both rational. Famous…

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,…

We explore the sums of $k$ consecutive terms in the generalized Fibonacci sequence $\left(G_n\right)_{n \geq 0}$ given by the recurrence $G_n = G_{n-1} + G_{n-2}$ for all $n \geq 2$ with integral initial conditions $G_0$ and $G_1$. In…

It is well-known that for a quickly increasing sequence $(n_k)_{k \geq 1}$ the functions $(\cos 2 \pi n_k x)_{k \geq 1}$ show a behavior which is typical for sequences of independent random variables. If the growth condition on $(n_k)_{k…

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…

In this paper based on a sort of linear function, a deterministic and simple algorithm with an algebraic structure is presented for calculating all (and only) $k$-almost primes ($where$ $\exists n\in {\rm N} $, $1{\le} k {\le}n$) in certain…

Let $U = (U_n)_{n \geq 0}$ be a Lucas sequence and, for every prime number $p$, let $\rho_U(p)$ be the rank of appearance of $p$ in $U$, that is, the smallest positive integer $k$ such that $p$ divides $U_k$, whenever it exists.…

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this…

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Let $f_{n}=\sum_{i=0}^n \binom{n}{i}\binom{2n-2i}{n-i}$, $g_{n}= \sum_{i=1}^n \binom{n}{i}\binom{2n-2i}{n-i}$. Let $\{a_k\}_{k=1}$ be the set of all positive integers n, in increasing order, for which $\binom{2n}{n}$ is not divisible by 5,…

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

Generalized L\"uroth series generalize $b$-adic representations as well as L\"uroth series. Almost all real numbers are normal, but it is not easy to construct one. In this paper, a new construction of normal numbers with respect to…

Let $u_n$ be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek, 2006 to give a systematic approach towards the problem of determining all perfect powers in any particular Lucas sequence. We then…

Let $b \geq 2$ be an integer base with prime factors $p_1, \ldots, p_s$. In this paper we study sequences of "$b$-adic valuations" and last nonzero digits in $b$-adic expansions of the values $f(n) = (f_1(n), \ldots, f_s(n))$, where each…

We study Gibonacci sequences mod $m$, giving special attention to the Lucas numbers. It is known which $m$ have the property that the Fibonacci sequence contains all residues mod $m$. When $m$ has this property, we say that the Fibonacci…