The purpose of this paper is to prove that the common terms of linear recurrences $M(2a,-1,0,b)$ and $N(2c,-1,0,d)$ have at most $2$ common terms if $p=2$, and have at most three common terms if $p>2$ where $D$ and $p$ are fixed positive integers and $p$ is a prime, such that neither $D$ nor $D+p$ is perfect square, further $a,b,c,d$ are nonzero integers satisfying the equations $a^2-D{b}^2=1$ and $c^2-(D+p)d^2=1$.

For an integer k ≥ 2, let $\left(F{ₙ}^{\left(k\right)}\right)ₙ$ be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.

Let $k\ge 2$ and define $F^{\left(k\right)}:={\left(F_n^{\left(k\right)}\right)}_{n\ge 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{\left(k\right)}=F_{n-1}^{\left(k\right)}+F_{n-2}^{\left(k\right)}+\cdots +F_{n-k}^{\left(k\right)}$, with initial conditions $0,0,\cdots ,0,1$ ($k$ terms) and such that the first nonzero term is $F_1^{\left(k\right)}=1$. The sequences $F:=F^{\left(2\right)}$ and $T:=F^{\left(3\right)}$ are the known Fibonacci and Tribonacci sequences, respectively. In 2005, Noe and Post made a conjecture related to the possible solutions of the Diophantine equation $F_n^{\left(k\right)}=F_m^{\left(\ell \right)}$. In this note, we use transcendental tools to provide a general method for finding the intersections $F^{\left(k\right)}\cap F^{\left(m\right)}$ which gives...

The non-commutative neutrix product of the distributions $ln{x}_{+}$ and $x_{+}^{-s}$ is proved to exist for $s=1,2,...$ and is evaluated for $s=1,2$. The existence of the non-commutative neutrix product of the distributions $x_{+}^{-r}$ and $x_{+}^{-s}$ is then deduced for $r,s=1,2,...$ and evaluated for $r=s=1$.