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$. ...

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

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.$

Let $\alpha \>1$ be irrational. Several authors studied the numbers $${\ell }^m\left(\alpha \right)=inf\left\{\right|y|:y\in {\Lambda }_m,y\ne 0\},$$ where $m$ is a positive integer and ${\Lambda }_m$ denotes the set of all real numbers of the form $y={ϵ}_0{\alpha }^n+{ϵ}_1{\alpha }^{n-1}+\cdots +{ϵ}_{n-1}\alpha +{ϵ}_n$ with restricted integer coefficients $|{ϵ}_i|\le m$. The value of ${\ell }^1\left(\alpha \right)$ was determined for many particular Pisot numbers and ${\ell }^m\left(\alpha \right)$ for the golden number. In this paper the value of ${\ell }^m\left(\alpha \right)$ is determined for irrational numbers $\alpha$, satisfying ${\alpha }^2=a\alpha \pm 1$ with a positive integer $a$.

Let $\left\{U_n\right\}=\left\{U_n(P,Q)\right\}$ and $\left\{V_n\right\}=\left\{V_n(P,Q)\right\}$ be the Lucas sequences of the first and second kind respectively at the parameters $P\ge 1$ and $Q\in \{-1,1\}$. In this paper, we provide a technique for characterizing the solutions of the so-called Bartz-Marlewski equation $$x^2-3xy+y^2+x=0,$$ where $(x,y)=(U_i,U_j)$ or $(V_i,V_j)$ with $i$, $j\ge 1$. Then, the procedure of this technique is applied to completely resolve this equation with certain values of such parameters.

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 ${\left(L_n\right)}_{n\ge 0}$ be the Lucas sequence. We show that the Diophantine equation $L_n-L_m=M_k$ has only the nonnegative integer solutions $(n,m,k)=(2,0,1)$, $(3,1,2)$, $(3,2,1)$, $(4,3,2)$, $(5,3,3)$, $(6,2,4)$, $(6,5,3)$ where $M_k=2^k-1$ is the $k$th Mersenne number and $n>m$.

A natural number $n$ is said to be a $(k,r)$-integer if $n=a^{k}b$, where $k>r>1$ and $b$ is not divisible by the $r$th power of any prime. We study the distribution of such $(k,r)$-integers in the Piatetski-Shapiro sequence $\left\{\lfloor n^c\rfloor \right\}$ with $c>1$. As a corollary, we also obtain similar results for semi-$r$-free integers.

Let $f^j={\sum }_k{a}_{k}f(2^{j+1}x-2k)$, where the sum is taken over the lattice of all points k in ${ℝ}^n$ having integer-valued components, j∈ℕ and $a_k\in ℂ$. Let $A_{pq}^s$ be either $B_{pq}^s$ or $F_{pq}^s$ (s ∈ ℝ, 0 < p < ∞, 0 < q ≤ ∞) on ${ℝ}^n.$ The aim of the paper is to clarify under what conditions $\parallel f^j|A_{pq}^s\parallel$ is equivalent to $2^{j(s-n/p)}({\sum }_k|a_k{|}^p{)}^{1/p}\parallel f|A_{pq}^s\parallel$.

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let $\alpha$ and $\beta$ be two multiplicatively independent Perron numbers. Then a sequence $x\in A^{\mathbb{N}}$, where $A$ is a finite alphabet, is both $\alpha$-substitutive and $\beta$-substitutive if and only if $x$ is ultimately...

Consider a recurrence sequence ${\left(x_k\right)}_{k\in \mathbb{Z}}$ of integers satisfying $x_{k+n}=a_{n-1}{x}_{k+n-1}+...+a₁x_{k+1}+a₀x_k$, where $a₀,a₁,...,a_{n-1}\in \mathbb{Z}$ are fixed and a₀ ∈ -1,1. Assume that $x_k>0$ for all sufficiently large k. If there exists k₀∈ ℤ such that $x_{k₀}<0$ then for each negative integer -D there exist infinitely many rational primes q such that $q|x_k$ for some k ∈ ℕ and (-D/q) = -1.

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.$

We show that any ${\Sigma }_s$-product of at most $𝔠$-many $L\Sigma (\le \omega )$-spaces has the $L\Sigma (\le \omega )$-property. This result generalizes some known results about $L\Sigma (\le \omega )$-spaces. On the other hand, we prove that every ${\Sigma }_s$-product of monotonically monolithic spaces is monotonically monolithic, and in a similar form, we show that every ${\Sigma }_s$-product of Collins-Roscoe spaces has the Collins-Roscoe property. These results generalize some known results about the Collins-Roscoe spaces and answer some questions due to Tkachuk [Lifting the Collins-Roscoe...

In a Tychonoff space $X$, the point $p\in X$ is called a $C^{*}$-point if every real-valued continuous function on $C\setminus \left\{p\right\}$ can be extended continuously to $p$. Every point in an extremally disconnected space is a $C^{*}$-point. A classic example is the space ${𝐖}^{*}={\omega }_1+1$ consisting of the countable ordinals together with ${\omega }_1$. The point ${\omega }_1$ is known to be a $C^{*}$-point as well as a $P$-point. We supply a characterization of $C^{*}$-points in totally ordered spaces. The remainder of our time is aimed at studying when a point in a product space...