Let $a$ and $b\in \mathbb{N}$. Denote by $R_{a,b}$ the set of all integers $n>1$ whose canonical prime representation $n=p_1^{{\alpha }_1}{p}_2^{{\alpha }_2}\cdots p_r^{{\alpha }_r}$ has all exponents ${\alpha }_i$ $(1\le i\le r)$ being a multiple of $a$ or belonging to the arithmetic progression $at+b$, $t\in {\mathbb{N}}_0:=\mathbb{N}\cup \left\{0\right\}$. All integers in $R_{a,b}$ are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

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

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

A geometric progression of length k and integer ratio is a set of numbers of the form $a,ar,...,a{r}^{k-1}$ for some positive real number a and integer r ≥ 2. For each integer k ≥ 3, a greedy algorithm is used to construct a strictly decreasing sequence ${\left(a_i\right)}_{i=1}^{\infty }$ of positive real numbers with a₁ = 1 such that the set $G^{\left(k\right)}={\bigcup }_{i=1}^{\infty }(a_{2i},a_{2i-1}]$ contains no geometric progression of length k and integer ratio. Moreover, $G^{\left(k\right)}$ is a maximal subset of (0,1] that contains no geometric progression of length k and integer ratio. It is also proved that...

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

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.

We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer $k\ge 2$ and every set $A$ of words over $k$ satisfying $\lim {\sup }_{n\to \infty }|A\cap {\left[k\right]}^n|/k^n>0$ there exist a word $c$ over $k$ and a sequence $\left(w_n\right)$ of left variable words over $k$ such that the set $c\cup \{c^{}{w}_0{\left(a_0\right)}^{}..{.}^{}{w}_n\left(a_n\right):n\in \mathbb{N}\text{and}{a}_0,...,a_n\in \left[k\right]\}$ is contained in $A$. While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.

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

The Golomb space ${\mathbb{N}}_{\tau }$ is the set $\mathbb{N}$ of positive integers endowed with the topology $\tau$ generated by the base consisting of arithmetic progressions $\{a+bn:n\ge 0\}$ with coprime $a,b$. We prove that the Golomb space ${\mathbb{N}}_{\tau }$ is topologically rigid in the sense that its homeomorphism group is trivial. This resolves a problem posed by T. Banakh at Mathoverflow in 2017.

Let ${𝒫}_2$ denote a positive integer with at most $2$ prime factors, counted according to multiplicity. For integers $a$, $q$ such that $(a,q)=1$, let ${𝒫}_2(q,a)$ denote the least ${𝒫}_2$ in the arithmetic progression ${\{nq+a\}}_{n=1}^{\infty }$. It is proved that for sufficiently large $q$, we have $${𝒫}_2(q,a)\ll q^{1.825}.$$ This result constitutes an improvement upon that of J. Li, M. Zhang and Y. Cai (2023), who obtained ${𝒫}_2(q,a)\ll q^{1.8345}.$

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