We derive two identities for multiple basic hyper-geometric series associated with the unitary $U(n+1)$ group. In order to get the two identities, we first present two known $q$-exponential operator identities which were established in our earlier paper. From the two identities and combining them with the two $U(n+1)$ $q$-Chu-Vandermonde summations established by Milne, we arrive at our results. Using the identities obtained in this paper, we give two interesting identities involving binomial...

We compare the growth of the least common multiple of the numbers $u_{a_1},...,u_{a_n}$ and $|u_{a_1}\cdots u_{a_n}|$, where ${\left(u_n\right)}_{n\ge 0}$ is a Lucas sequence and ${\left(a_n\right)}_{n\ge 0}$ is some sequence of positive integers.

Let $𝒜$ be a noncommutative prime ring equipped with an involution ‘$*$’, and let ${𝒬}_{ms}\left(𝒜\right)$ be the maximal symmetric ring of quotients of $𝒜$. Consider the additive maps $\mathscr{H}$ and $𝒯:𝒜\to {𝒬}_{ms}\left(𝒜\right)$. We prove the following under some inevitable torsion restrictions. (a) If $m$ and $n$ are fixed positive integers such that $(m+n)𝒯\left(a^2\right)=m𝒯\left(a\right)a^{*}+na𝒯\left(a\right)$ for all $a\in 𝒜$ and $(m+n)\mathscr{H}\left(a^2\right)=m\mathscr{H}\left(a\right)a^{*}+na𝒯\left(a\right)$ for all $a\in 𝒜$, then $\mathscr{H}=0$. (b) If $𝒯\left(aba\right)=a𝒯\left(b\right)a^{*}$ for all $a,b\in 𝒜$, then $𝒯=0$. Furthermore, we characterize Jordan left $\tau$-centralizers in semiprime rings admitting an anti-automorphism $\tau$. As applications, we find the...

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation ${(-1)}^{u}r{a}^x+{(-1)}^{v}s{b}^y=c$ in nonnegative integers $x,y$ and integers $u,v\in \{0,1\}$, for given integers $a\>1$, $b\>1$, $c\>0$, $r\>0$ and $s\>0$. When $gcd(ra,sb)=1$, we show that $N\le 3$ except for a finite number of cases all of which satisfy $max(a,b,r,s,x,y)\<2·{10}^{15}$ for each solution; when $gcd(a,b)\>1$, we show that $N\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N=3$ solutions.

Let $p=1+2^{e+1}q$ be an odd prime number with q an odd integer. Let δ (resp. φ) be an odd (resp. even) Dirichlet character of conductor p and order $2^{e+1}$ (resp. order $d_{\phi }$ dividing q), and let ψₙ be an even character of conductor $p^{n+1}$ and order pⁿ. We put χ = δφψₙ, whose value is contained in $Kₙ=\mathbb{Q}\left({\zeta }_{(p-1)pⁿ}\right)$. It is well known that the Bernoulli number $B_{1,\chi }$ is not zero, which is shown in an analytic way. In the extreme cases $d_{\phi }=1$ and q, we show, in an algebraic and elementary manner, a stronger nonvanishing result: $T{r}_{n/1}\left(\xi B_{1,\chi }\right)\ne 0$ for any...

In this paper, we find all Pell and Pell-Lucas numbers written in the form $-2^a-3^b+5^c$, in nonnegative integers $a$, $b$, $c$, with $0\le max\{a,b\}\le c$.

In this paper, we examine a natural question concerning the divisors of the polynomial $x^n-1$: “How often does $x^n-1$ have a divisor of every degree between $1$ and $n$?” In a previous paper, we considered the situation when $x^n-1$ is factored in $\mathbb{Z}\left[x\right]$. In this paper, we replace $\mathbb{Z}\left[x\right]$ with ${𝔽}_p\left[x\right]$, where $p$ is an arbitrary-but-fixed prime. We also consider those $n$ where this condition holds for all $p$.

We show that the only Lucas numbers which are factoriangular are $1$ and $2$.

For an integer $k\ge 2$, let ${\left(n\right)}_n$ be the $k-$generalized Pell sequence which starts with $0,...,0,1$ ($k$ terms) and each term afterwards is given by the linear recurrence $n=2n-1+n-2+\cdots +n-k$. In this paper, we find all $k$-generalized Pell numbers with only one distinct digit (the so-called repdigits). Some interesting estimations involving generalized Pell numbers, that we believe are of independent interest, are also deduced. This paper continues a previous work that searched for repdigits in the usual Pell sequence ${\left(P_n^{\left(2\right)}\right)}_n$. ...

If the space $𝒬$ of quadratic forms in ${ℝ}^n$ is splitted in a direct sum ${𝒬}_1\oplus ...\oplus {𝒬}_k$ and if $X$ and $Y$ are independent random variables of ${ℝ}^n$, assume that there exist a real number $a$ such that $E\left(X\right|X+Y)=a(X+Y)$ and real distinct numbers $b_1,...,b_k$ such that $E\left(q\left(X\right)\right|X+Y)=b_{i}q(X+Y)$ for any $q$ in ${𝒬}_i.$ We prove that this happens only when $k=2$, when ${ℝ}^n$ can be structured in a Euclidean Jordan algebra and when $X$ and $Y$ have Wishart distributions corresponding to this structure.

The sequence of balancing numbers $\left(B_n\right)$ is defined by the recurrence relation $B_n=6B_{n-1}-B_{n-2}$ for $n\ge 2$ with initial conditions $B_0=0$ and $B_1=1.$ $B_n$ is called the $n$th balancing number. In this paper, we find all repdigits in the base $b,$ which are sums of four balancing numbers. As a result of our theorem, we state that if $B_n$ is repdigit in the base $b$ and has at least two digits, then $(n,b)=(2,5),(3,6)$. Namely, $B_2=6={\left(11\right)}_5$ and $B_3=35={\left(55\right)}_6.$

Let $M$ be a given nonempty set of positive integers and $S$ any set of nonnegative integers. Let $\overline{\delta }\left(S\right)$ denote the upper asymptotic density of $S$. We consider the problem of finding $$\mu \left(M\right):=\underset{S}{sup}\overline{\delta }\left(S\right),$$ where the supremum is taken over all sets $S$ satisfying that for each $a,b\in S$, $a-b\notin M.$ In this paper we discuss the values and bounds of $\mu \left(M\right)$ where $M=\{a,b,a+nb\}$ for all even integers and for all sufficiently large odd integers $n$ with $a<b$ and $gcd(a,b)=1.$

Let $k\ge 2$ and let ${\left(P_n^{\left(k\right)}\right)}_{n\ge 2-k}$ be the $k$-generalized Pell sequence defined by $$P_n^{\left(k\right)}=2P_{n-1}^{\left(k\right)}+P_{n-2}^{\left(k\right)}+\cdots +P_{n-k}^{\left(k\right)}$$ for $n\ge 2$ with initial conditions $$P_{-(k-2)}^{\left(k\right)}=P_{-(k-3)}^{\left(k\right)}=\cdots =P_{-1}^{\left(k\right)}=P_0^{\left(k\right)}=0,P_1^{\left(k\right)}=1.$$ In this study, we handle the equation $P_n^{\left(k\right)}=y^m$ in positive integers $n$, $m$, $y$, $k$ such that $k,y\ge 2,$ and give an upper bound on $n.$ Also, we will show that the equation $P_n^{\left(k\right)}=y^m$ with $2\le y\le 1000$ has only one solution given by $P_7^{\left(2\right)}={13}^2.$