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

In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the…

Let $F_1=1,F_2=1,\ldots$ be the Fibonacci sequence. Motivated by the identity $\displaystyle\sum_{k=0}^{\infty}\frac{1}{F_{2^k}}=\frac{7-\sqrt{5}}{2}$, Erd\"os and Graham asked whether $\displaystyle\sum_{k=1}^{\infty}\frac{1}{F_{n_k}}$ is…

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are distinct and coprime. Let $\mathcal{S}$ be the set of non-negative integers, all of whose digits in base $b$ are either $d_1$ or $d_2$. Then…

Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…

We improve unconditional estimates on $\Delta_k(x)$, the remainder term of the generalised divisor function, for large $k$. In particular, we show that $\Delta_k(x) \ll x^{1 - 1.889k^{-2/3}}$ for all sufficiently large fixed $k$.

It has been known since Erdos that the sum of $1/(n\log n)$ over numbers $n$ with exactly $k$ prime factors (with repetition) is bounded as $k$ varies. We prove that as $k$ tends to infinity, this sum tends to 1. Banks and Martin have…

We generalize the universal power series of Seleznev to several variables and we allow the coefficients to depend on parameters. Then, the approximable functions may depend on the same parameters. The universal approximation holds on…

We study almost inner derivations of $2$-step nilpotent Lie algebras of genus $2$, i.e., having a $2$-dimensional commutator ideal, using matrix pencils. In particular we determine all almost inner derivations of such algebras in terms of…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated…

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

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

Denote by $\Gamma$ the set of pointwise good sequences. Those are sequences of real numbers $(a_k)$ such that for any measure preserving flow $(U_t)_{t\in \mathbb R}$ on a probability space and for any $f\in L^\infty$, the averages…

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

In 1878 \'E. Lucas proved a remarkable result which provides a simple way to compute the binomial coefficient ${n\choose m}$ modulo a prime $p$ in terms of the binomial coefficients of the base-$p$ digits of $n$ and $m$: {\it If $p$ is a…

Let P and Q be non-zero integers. The Lucas sequence U_n(P,Q) is defined by U_0=0, U_1=1, U_n= P*U_{n-1}-Q*U_{n-2} for n >1. The question of when U_n(P,Q) can be a perfect square has generated interest in the literature. We show that for…

Let P and Q be non-zero relatively prime integers. The Lucas sequence {U_n(P,Q) is defined by U_0=0, U_1=1, U_n = P U_{n-1}-Q U_{n-2} for n>1. The sequence {U_n(1,-1)} is the familiar Fibonacci sequence, and it was proved by Cohn that the…

We show that the $Kn$--smooth part of $a^n-1$ for an integer $a>1$ is $a^{o(n)}$ for most positive integers $n$.

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…